Leaves and inverse degree of a graph

There are many long-standing conjectures on trees, and many invariants of graphs arose from Graffiti conjectures. Let diam(G) and id(G) = Σ u∈V(G) 1/deg G (u) be the diameter and the inverse degree of a connected graph G, respectively. The notation n d (G) indicates the number of vertices of degree...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bing Yao, Xiang-en Chen, Ming Yao, Jiajuan Zhang, Jingxia Guo
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Biomedical engineering Educational institutions Informatics Information science Mathematics Terminology USA Councils
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!