Ordering of Unicyclic Graphs with Cycle Length g and Vertices n
CSTR:
Author:
- LIU Ying
LIU Ying
Department of Mathematics,Tongji University,Shanghai 200092,China;College of Mathematics and Information,Lixin University of Commerce,Shanghai 201620,China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site - LIU Yue
LIU Yue
Department of Mathematics,Tongji University,Shanghai 200092,China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site
- Article | |
- Metrics |
- Reference |
- Related |
- Cited by | |
- Comments
Abstract:
A unicyclic graph is either a cycle or a cycle with trees attached. GUO Jiming gave the first largest Laplacian spectral radius among all unicyclic graphs with cycle length g and n vertices. In this paper,the first largest ［g/2］graphs is determined according to Laplacian spectral radii among all unicyclic graphs with cycle length g and n=g+k(g≥5,k≥3) vertices.
Get Citation
LIU Ying, LIU Yue. Ordering of Unicyclic Graphs with Cycle Length g and Vertices n[J].同济大学学报(自然科学版),2009,37(1):
CopyShare
Article Metrics
- Abstract:
- PDF:
- HTML:
- Cited by:
History
Article QR Code
