On the spectral radius of unicyclic graphs with perfect matchings
By A. Chang, F. Tian. 2003
66 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/336cd0babaa11d53241477565817d78e1e5e198a
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
In Discrete Mathematics and Combinatorics
In Geometry and Topology
Citations in the corpus
- The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices (2005, background): “Chang and Tian [3] determined graphs with the largest and the second largest spectral radius among all the unicyclic graphs on n vertices with perfect matching.”