Spectral characterizations of lollipop graphs

By Willem H. Haemers, Xiaogang Liu, Yuanping Zhang. 2008

90 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/5c8ae321839eef254417e4cd29d6dc98d42121c6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Xiaogang Liu
2. Shunyi Liu

In Geometry and Topology

1. Xiaogang Liu
2. Shunyi Liu

Citations in the corpus

• On the A-characteristic polynomial of a graph (2017, background): “Up until now, many graphs have been proved to be determined by its A-spectrum or Qspectrum, for examples, the path [4, Proposition 1], the cycle [4, Proposition 5], the complete graphs [4, Proposition 5], the lollipop graph [1, 6, 18], ect.”