Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Maximum degree distance of graphs with exactly two cycles

From MaRDI portal
Publication:3097332
Jump to:navigation, search

zbMATH Open1249.05064MaRDI QIDQ3097332FDOQ3097332


Authors: Zhibin Du, Bo Zhou Edit this on Wikidata


Publication date: 15 November 2011





Recommendations

  • Degree distance of unicyclic and bicyclic graphs
  • Degree distance of unicyclic graphs
  • On the degree distance of a graph
  • scientific article; zbMATH DE number 6386250
  • Bounds for degree distance of a graph


zbMATH Keywords

distancedegreebucycle graph


Mathematics Subject Classification ID

Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12) Paths and cycles (05C38) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)



Cited In (3)

  • Degree distance and vertex-connectivity
  • Title not available (Why is that?)
  • Status connectivity indices of line graphs





This page was built for publication: Maximum degree distance of graphs with exactly two cycles

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3097332&oldid=16185583"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:50. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki