G-2017-10
Edge realizability of connected simple graphs
, , , , , and BibTeX reference
Necessary and sufficient conditions are provided for the existence of a simple
graph, or a simple connected graph with given
numbers mij
of edges with end-degrees i,j
for i≤j∈{1,2,…,Δ}
, where Δ
is the maximum degree.
Moreover this allows to determine the kth
minimum or maximum value of all Adriatic indices together with the corresponding graphs.
Published February 2017 , 19 pages
Research Axis
Research applications
Publication
Nov 2017
Edge realizability of connected simple graphs
, , , , , and
MATCH Communications in Mathematical and in Computer Chemistry, 78(3), 689–712, 2017
BibTeX reference