Results 11 to 20 of about 5,819 (125)
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 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.
Chun-Li Kan +3 more
doaj +2 more sources
Seidel Laplacian and Seidel Signless Laplacian Spectrum of the Zero-divisor Graph on the Ring of Integers Modulo [PDF]
Mathematics and Statistics, 2021 Let G be a simple graph of order n and let S p G q be the Seidel matrix of G , defined as S p G q (cid:16) r s ij s where s ij (cid:16) (cid:1) 1 if the vertices v i and v j are adjacent and s ij (cid:16) 1 if the vertices v i and v j are not adjacent and
Magi P M, S. Jose, Anjaly Kishore
semanticscholar +2 more sources
The Fan Graph is Determined by its Signless Laplacian Spectrum
Czechoslovak Mathematical Journal, 2020 Given a graph G , if there is no nonisomorphic graph H such that G and H have the same signless Laplacian spectra, then we say that G is Q -DS. In this paper we show that every fan graph F n is Q -DS, where F n = K 1 ∨ P n −1 and n ⩾ 3.
Muhuo Liu, Yuan Yuan, K. Das
semanticscholar +3 more sources
New bounds for the spread of the signless Laplacian spectrum [PDF]
Mathematical Inequalities & Applications, 2014 The spread of the singless Laplacian of a simple graph G is defined as SQ(G) = μ1(G)− μn(G) , where μ1(G) and μn(G) are the maximum and minimum eigenvalues of the signless Laplacian matrix of G , respectively.
A. Güngör, A. Cevik, N. Habibi
semanticscholar +3 more sources
The spectrum and the signless Laplacian spectrum of coronae
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu-Yu Cui, Gui-xian Tian
semanticscholar +3 more sources
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, 2021 A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP-complete that deciding whether a graph is pancyclic.
Guidong Yu +3 more
doaj +2 more sources
The signless Laplacian matrix of hypergraphs
Special Matrices, 2022 In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj +2 more sources
Determining some graph joins by the signless Laplacian spectrum
Discrete Applied MathematicsA graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the complete bipartite
Jiachang Ye, Jianguo Qian, Zoran Stanić
semanticscholar +3 more sources
THE SUN GRAPH IS DETERMINED BY ITS SIGNLESS LAPLACIAN SPECTRUM [PDF]
The Electronic Journal of Linear Algebra, 2010 For a simple undirected graph G, the corresponding signless Laplacian matrix is defined as D(G) + A(G) in which D(G) and A(G) are degree matrix and adjacency matrix of G, respectively. The graph G is said to be determined by its signless Laplacian spectrum, if any graph having the same signless Laplacian spectrum as G is isomorphic to G.
Maryam Mirzakhah, D. Kiani
semanticscholar +2 more sources
Common neighborhood (signless) Laplacian spectrum and energy of CCC-graph
Boletim da Sociedade Paranaense de MatemáticaIn this paper, we consider commuting conjugacy class graph (abbreviated as CCC-graph) of a finite group $G$ which is a graph with vertex set $\{x^G : x \in G \setminus Z(G)\}$ (where $x^G$ denotes the conjugacy class containing $x$) and two distinct ...
Firdous Ee Jannat, R. K. Nath
semanticscholar +3 more sources