Results 31 to 40 of about 1,271 (139)
Some Chemistry Indices of Clique‐Inserted Graph of a Strongly Regular Graph
Complexity, Volume 2021, Issue 1, 2021., 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique‐inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique‐inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique‐inserted ...
Chun-Li Kan +4 more
wiley +1 more source
Seidel Signless Laplacian Energy of Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 Let S(G) be the Seidel matrix of a graph G of order n and let DS(G)=diag(n-1-2d1, n-1-2d2,..., n-1-2dn) be the diagonal matrix with d_i denoting the degree of a vertex v_i in G.
Harishchandra Ramane +3 more
doaj +1 more source
Some bounds on spectral radius of signless Laplacian matrix of k-graphs
RAIRO - Operations Research, 2023 For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signless Laplacian matrix, and this name comes from the fact that Q(H) is exactly the well-known signless Laplacian matrix for 2-graph. Define the largest eigenvalue ρ(H) of Q(H) as the spectral radius of H.
Zhang, Junhao, Zhu, Zhongxun
openaire +1 more source
On the spread of the distance signless Laplacian matrix of a graph
Acta Universitatis Sapientiae, Informatica, 2023 Abstract Let G be a connected graph with n vertices, m edges. The distance signless Laplacian matrix DQ(G) is defined as DQ(G) = Diag(Tr(G)) + D(G), where Diag(Tr(G)) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix of G.
Pirzada S., Haq Mohd Abrar Ul
openaire +3 more sources
Signless Laplacian determinations of some graphs with independent edges
Karpatsʹkì Matematičnì Publìkacìï, 2018 Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
Trends in Computational and Applied Mathematics, 2021 We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
Communications in Advanced Mathematical Sciences, 2018 The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$.
Rao Li
doaj +1 more source
Bipartite subgraphs and the signless Laplacian matrix
Applicable Analysis and Discrete Mathematics, 2011 For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue. We investigate how vectors yielding small values of the Rayleigh quotient for the signless Laplacian matrix can be used to identify bipartite subgraphs.
Steve Kirkland, Debdas Paul
openaire +2 more sources
Cospectral constructions for several graph matrices using cousin vertices
Special Matrices, 2021 Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]
, 2016 In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the ...
Shu, Yujie, You, Lihua, Zhang, Xiao-Dong
core +2 more sources