Can I read Degree Distance of Unicyclic and Bicyclic Graphs on EtoBox?

Degree Distance of Unicyclic and Bicyclic Graphs by Aleksandar Ilić; Dragan Stevanović; Lihua Feng; Guihai Yu; Peter Dankelmann is a Computer Science article available to read on EtoBox.

What is Degree Distance of Unicyclic and Bicyclic Graphs about?

Let G be a connected graph with vertex set V (G). The degree distance of G is defined as is the degree of vertex u, and d(u, v) denotes the distance between u and v. Here we characterize n-vertex unicyclic graphs with girth k, having minimum and maximum degree distance, respectively. Furthermore, we prove that the graph B n , obtained from two triangles linked by a path, is the unique graph having the maximum degree distance among bicyclic graphs, which resolves a recent conjecture of Tomescu.

Who reads Degree Distance of Unicyclic and Bicyclic Graphs?

Author

Aleksandar Ilić; Dragan Stevanović; Lihua Feng; Guihai Yu; Peter Dankelmann

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)

Published

2011

Language

EN

Field

Computer Science (Physical Sciences)