On Integral Graphs with Few Cycles

被引：0
|
作者：
G. R. Omidi
机构：
[1] Isfahan University of Technology,Department of Mathematical Sciences
[2] Institute for Research in Fundamental Sciences (IPM),School of Mathematics
来源：
Graphs and Combinatorics | 2009年 / 25卷
关键词：
Integral graphs; Complete matchings; Bipartite graphs; 05C50;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A graph is called integral if the spectrum of its adjacency matrix has only integer eigenvalues. In this paper, all integral graphs with at most two cycles (trees, unicyclic and bicyclic graphs) with no eigenvalue 0 are identified. Moreover, we give some results on unicyclic integral graphs with exactly one eigenvalue 0.
引用
收藏
页码：841 / 849
页数：8
相关论文
共 50 条
  • [11] Random Unlabelled Graphs Containing Few Disjoint Cycles
    Kang, Mihyun
    McDiarmid, Colin
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (1-2) : 174 - 204
  • [12] The regularity method for graphs with few 4-cycles
    Conlon, David
    Fox, Jacob
    Sudakov, Benny
    Zhao, Yufei
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2021, 104 (05): : 2376 - 2401
  • [13] Ordering trees and graphs with few cycles by algebraic connectivity
    Abreu, Nair
    Justel, Claudia Marcela
    Rojo, Oscar
    Trevisan, Vilmar
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 458 : 429 - 453
  • [14] Finding Hamilton Cycles in Random Graphs With Few Queries
    Ferber, Asaf
    Krivelevich, Michael
    Sudakov, Benny
    Vieira, Pedro
    RANDOM STRUCTURES & ALGORITHMS, 2016, 49 (04) : 635 - 668
  • [15] Complete minors in cubic graphs with few short cycles and random cubic graphs
    Markström, K
    ARS COMBINATORIA, 2004, 70 : 289 - 295
  • [16] A FEW MORE PROPERTIES OF SUM AND INTEGRAL SUM GRAPHS
    Vilfred, V.
    Suryakala, A.
    Mary, K.
    JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2014, 20 (02) : 149 - 159
  • [17] FEW HAMILTONIAN CYCLES IN GRAPHS WITH ONE OR TWO VERTEX DEGREES
    Goedgebeur, Jan
    Jooken, Jorik
    Lo, On-Hei Solomon
    Seamone, Ben
    Zamfirescu, Carol T.
    MATHEMATICS OF COMPUTATION, 2024, 93 (350) : 3059 - 3082
  • [18] Heavy cycles and spanning trees with few leaves in weighted graphs
    Li, Binlong
    Zhang, Shenggui
    APPLIED MATHEMATICS LETTERS, 2011, 24 (06) : 908 - 910
  • [19] Color-critical graphs and hypergraphs with few edges and no short cycles
    Abbott, HL
    Hare, DR
    Zhou, B
    DISCRETE MATHEMATICS, 1998, 182 (1-3) : 3 - 11
  • [20] Two-factors with few cycles in claw-free graphs
    Gould, RJ
    Jacobson, MS
    DISCRETE MATHEMATICS, 2001, 231 (1-3) : 191 - 197
12345