Tricyclic and tetracyclic graphs with maximum and minimum eccentric connectivity

DOI10.7508/IJMSI.2016.01.012zbMATH Open1440.05134MaRDI QIDQ2834877FDOQ2834877

Authors: M. Tavakoli, A. R. Ashrafi, F. Rahbarnia 

Publication date: 24 November 2016

Published in: Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Recommendations

• Tricyclic graph whose least eigenvalue is minimum
• On the spectral radius of tricyclic graphs with a fixed diameter
• On the maximal eccentric connectivity indices of graphs
• On tricyclic graphs whose second largest eigenvalue does not exceed 1
• The Laplacian spectral radius of tricyclic graphs with a given girth

zbMATH Keywords

eccentric connectivity indextricyclic graphtetracyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Cited In (4)

• Tricyclic graph whose least eigenvalue is minimum
• Further results on Zagreb eccentricity coindices
• Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
• Extremal trees of given segment sequence with respect to some eccentricity-based invariants

This page was built for publication: Tricyclic and tetracyclic graphs with maximum and minimum eccentric connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834877)