Affordable Access

Comments to “The line graphs of lollipop graphs are determined by their spectra”

Authors
Journal
Linear Algebra and its Applications
0024-3795
Publisher
Elsevier
Publication Date
Volume
440
Identifiers
DOI: 10.1016/j.laa.2013.10.030
Keywords
  • Adjacency Matrix
  • Spectral Characterization
  • Least Eigenvalue −2
  • Line Graph
  • Lollipop Graph

Abstract

Abstract In J.F. Wang and S.N. Shu (2012) [2], the authors lost the condition that the line graph Lg,ln does not contain the cycle of order 4 in Lemma 3.4, which makes their main result (i.e., Theorem 3.1) of that paper not completely correct. Here, some comments are given.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

The line graphs of lollipop graphs are determined...

on Linear Algebra and its Applica... Apr 01, 2012

On the (signless) Laplacian spectral characterizat...

on Linear Algebra and its Applica... Jun 15, 2013

Spectral characterizations of lollipop graphs

on Linear Algebra and its Applica... Jan 01, 2008

A note on cycle spectra of line graphs

on Discrete Mathematics Jan 01, 2009
More articles like this..