First eigenvalue of nonsingular mixed graphs with given number of pendant vertices

被引:2
|
作者
Liu, Ruifang [1 ]
Jia, Huicai [2 ]
Yuan, Jinjiang [1 ]
机构
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Henan Inst Engn, Coll Sci, Zhengzhou 451191, Henan, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Nonsingular mixed graph; Laplacian matrix; First eigenvalue; Pendant vertices; ALGEBRAIC CONNECTIVITY; SIGNLESS LAPLACIAN; LEAST EIGENVALUE; FIXED GIRTH;
D O I
10.1016/j.laa.2014.04.006
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a mixed graph and L(G) be the Laplacian matrix of the mixed graph G. The first eigenvalue of G is referred to the least nonzero eigenvalue of L(G). Let MG(n, k) be the set of nonsingular mixed graphs with n vertices and k pendant vertices, where n >= 4. In this paper, up to a signature matrix, we determine the unique graph with the minimal first eigenvalue among all graphs hi MG(n, k). Thus we obtain a lower bound for the first eigenvalue of a mixed graph in terms of the number of pendant vertices. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:28 / 43
页数:16
相关论文
共 50 条
  • [21] The minimum Sombor index of trees with given number of pendant vertices
    Maitreyi, Venkatesan
    Elumalai, Suresh
    Balachandran, Selvaraj
    Liu, Hechao
    COMPUTATIONAL & APPLIED MATHEMATICS, 2023, 42 (08):
  • [22] The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
    Wang, Long
    Wei, Liangli
    Jin, Yongrong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 584 : 257 - 266
  • [23] The minimum Sombor index of trees with given number of pendant vertices
    Venkatesan Maitreyi
    Suresh Elumalai
    Selvaraj Balachandran
    Hechao Liu
    Computational and Applied Mathematics, 2023, 42
  • [24] Laplacian coefficients of trees with given diameter and number of pendant vertices
    Tan, Shang-Wang
    Wang, Qi-Long
    Zhongguo Shiyou Daxue Xuebao (Ziran Kexue Ban)/Journal of China University of Petroleum (Edition of Natural Science), 2013, 37 (02): : 186 - 190
  • [25] ENUMERATION OF GRAPHS WITH GIVEN NUMBER OF VERTICES OF ODD DEGREE
    TAZAWA, S
    COMBINATORICS /, 1988, 52 : 515 - 525
  • [26] Graphs with given odd sets and the least number of vertices
    Hakimi, SL
    JOURNAL OF GRAPH THEORY, 1997, 24 (01) : 81 - 83
  • [27] Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices
    Lal, Arbind Kumar
    Patra, Kamal Lochan
    Sahoo, Binod Kumar
    GRAPHS AND COMBINATORICS, 2011, 27 (02) : 215 - 229
  • [28] On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
    Zhongzhu Liu
    Bo Zhou
    Journal of Mathematical Sciences, 2012, 182 (2) : 175 - 192
  • [29] Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices
    Arbind Kumar Lal
    Kamal Lochan Patra
    Binod Kumar Sahoo
    Graphs and Combinatorics, 2011, 27 : 215 - 229
  • [30] THE LEAST LAPLACIAN EIGENVALUE OF THE UNBALANCED UNICYCLIC SIGNED GRAPHS WITH K PENDANT VERTICES
    Guo, Qiao
    Hou, Yaoping
    Li, Deqiong
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2020, 36