AbstractA graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian matrix Q, any graph having the same spectrum as G is isomorphic to G. The lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex of a path Pn−p. In this paper, it is proved that all lollipop graphs are determined by their Q-spectra
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractHaemers et al. [W.H. Haemers, X.G. Liu, Y.P. Zhang, Spectral characterizations of lollipop g...
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path wit...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractThe proof of Theorem 3.3 in [Y. Zhang, X. Liu, B. Zhang, X. Yong, The lollipop graph is dete...
AbstractHaemers et al. [W.H. Haemers, X.G. Liu, Y.P. Zhang, Spectral characterizations of lollipop g...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractThe proof of Theorem 3.3 in [Y. Zhang, X. Liu, B. Zhang, X. Yong, The lollipop graph is dete...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path wit...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractHaemers et al. [W.H. Haemers, X.G. Liu, Y.P. Zhang, Spectral characterizations of lollipop g...
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path wit...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractLet A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. ...
AbstractThe proof of Theorem 3.3 in [Y. Zhang, X. Liu, B. Zhang, X. Yong, The lollipop graph is dete...
AbstractHaemers et al. [W.H. Haemers, X.G. Liu, Y.P. Zhang, Spectral characterizations of lollipop g...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractThe proof of Theorem 3.3 in [Y. Zhang, X. Liu, B. Zhang, X. Yong, The lollipop graph is dete...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path wit...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
DOI
Add to ORKG
