Contents

Ars Combinatoria

  • Research article

Ordering Graphs with Maximum Degree \(3\) by Their Indices

Kexiang Xu1,2, Baogang Xu1
1School of Math. & Computer Science Nanjing Normal University, Nanjing, 210097
2College of Science Nanjing University of Aeronautics & Astronautics Nanjing, 210016
  • Published: 30/04/2009

Abstract

We consider the connected graphs with a unique vertex of maximum degree \(3\). Two subfamilies of such graphs are characterized and ordered completely by their indices. Moreover, a conjecture about the complete ordering of all graphs in this set is proposed.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Kexiang Xu, Baogang Xu. Ordering Graphs with Maximum Degree \(3\) by Their Indices[J], Ars Combinatoria, Volume 091. 193-201. .