On a Relation Between
A conjecture of AutoGraphiX on the relation between the Randic index R and the algebraic connectivity a of a connected graph G is:
Extremality of degree-based graph entropies
A Survey on the Randic Index
The general Randic index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real…
Rainbow Connections of Graphs: A Survey
This survey attempts to bring together most of the results and papers that dealt with the concept of rainbow connection, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity.
Fifty years of graph matching, network alignment and network comparison
Graphs and Combinatorics
Graphs and Combinatorics is an international journal, which was established in 1985. It is devoted to research concerning all aspects of combinatorial mathematics, especially graph theory and…
A Note on Distance-based Graph Entropies
This work explores graph entropies that are based on a novel information functional, which is the number of vertices with distance \(k\) to a given vertex, and investigates some properties thereof leading to a better understanding of this new information-theoretic quantity.
Extremal Matching Energy of Bicyclic Graphs
The energy of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Recently, Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the…
Extremal Theta-free planar graphs