99 research outputs found
Further results on the nullity of signed graphs
The nullity of a graph is the multiplicity of the eigenvalues zero in its
spectrum. A signed graph is a graph with a sign attached to each of its edges.
In this paper, we obtain the coefficient theorem of the characteristic
polynomial of a signed graph, give two formulae on the nullity of signed graphs
with cut-points. As applications of the above results, we investigate the
nullity of the bicyclic signed graph , obtain the
nullity set of unbalanced bicyclic signed graphs, and thus determine the
nullity set of bicyclic signed graphs.Comment: 17 pages. arXiv admin note: text overlap with arXiv:1207.6765,
arXiv:1107.0400 by other author
Laplacian coefficients of unicyclic graphs with the number of leaves and girth
Let be a graph of order and let be the characteristic polynomial of its
Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c},
M. Ili\'{c}, Laplacian coefficients of trees with given number of leaves or
vertices of degree two, Linear Algebra and its Applications
431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian
coefficients in the set of all -vertex unicyclic graphs
with the number of leaves , we investigate properties of the minimal
elements in the partial set of the Laplacian
coefficients, where denote the set of -vertex
unicyclic graphs with the number of leaves and girth . These results are
used to disprove their conjecture. Moreover, the graphs with minimum
Laplacian-like energy in are also studied.Comment: 19 page, 4figure
Laplacian spectral characterization of roses
A rose graph is a graph consisting of cycles that all meet in one vertex. We
show that except for two specific examples, these rose graphs are determined by
the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J.
Liu and Q.X. Huang, Laplacian spectral characterization of 3-rose graphs,
Linear Algebra Appl. 439 (2013), 2914--2920]. We also show that if two rose
graphs have a so-called universal Laplacian matrix with the same spectrum, then
they must be isomorphic. In memory of Horst Sachs (1927-2016), we show the
specific case of the latter result for the adjacency matrix by using Sachs'
theorem and a new result on the number of matchings in the disjoint union of
paths
The inertia of weighted unicyclic graphs
Let be a weighted graph. The \textit{inertia} of is the triple
, where
are the number of the positive, negative and zero
eigenvalues of the adjacency matrix of including their
multiplicities, respectively. , is called the
\textit{positive, negative index of inertia} of , respectively. In this
paper we present a lower bound for the positive, negative index of weighted
unicyclic graphs of order with fixed girth and characterize all weighted
unicyclic graphs attaining this lower bound. Moreover, we characterize the
weighted unicyclic graphs of order with two positive, two negative and at
least zero eigenvalues, respectively.Comment: 23 pages, 8figure
The skew energy of random oriented graphs
Given a graph , let be an oriented graph of with the
orientation and skew-adjacency matrix . The skew energy
of the oriented graph , denoted by , is
defined as the sum of the absolute values of all the eigenvalues of
. In this paper, we study the skew energy of random oriented
graphs and formulate an exact estimate of the skew energy for almost all
oriented graphs by generalizing Wigner's semicircle law. Moreover, we consider
the skew energy of random regular oriented graphs , and get an
exact estimate of the skew energy for almost all regular oriented graphs.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1011.6646 by
other author
- β¦