On the δ-chromatic numbers of the Cartesian products of graphs
Open MathematicsIn this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source
Extremal values on Zagreb indices of trees with given distance k-domination number. [PDF]
J Inequal Appl, 2018 Pei L, Pan X.
europepmc +1 more source
On Properties of Distance-Based Entropies on Fullerene Graphs. [PDF]
Entropy (Basel), 2019 Ghorbani M +4 more
europepmc +1 more source
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application. [PDF]
J Inequal Appl, 2017 He J, Liu YM, Tian JK, Liu XH.
europepmc +1 more source
The F-coindex of some graph operations. [PDF]
Springerplus, 2016 De N, Nayeem SM, Pal A.
europepmc +1 more source
Minimum-Loop Realization of Degree Sequences. [PDF]
J Res Natl Bur Stand (1977), 1982 Goldman AJ, Byrd RH.
europepmc +1 more source
Functions on adjacent vertex degrees of trees with given degree sequence
Open Mathematics, 2014 Wang Hua
doaj +1 more source
Properties of Labeling Methods for Determining Shortest Path Trees. [PDF]
J Res Natl Bur Stand (1977), 1981 Shier DR, Witzgall C.
europepmc +1 more source
Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index. [PDF]
HeliyonDehgardi N, Azari M, Shang Y.
europepmc +1 more source
Graphs with given connectivity and their minimum Sombor index having applications to QSPR studies of monocarboxylic acids. [PDF]
HeliyonHayat S, Arshad M, Khan A.
europepmc +1 more source