Cubic Graphs with Total Domatic Number at Least Two
Discussiones Mathematicae Graph Theory, 2018 Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S.
Akbari Saieed +3 more
doaj +1 more source
Andronov-Hopf and Neimark-Sacker bifurcations in time-delay differential equations and difference equations with applications to models for diseases and animal populations. [PDF]
Adv Differ Equ, 2020 Darlai R, Moore EJ, Koonprasert S.
europepmc +1 more source
Improved McClelland and Koolen-Moulton bounds for distance energy of a graph. [PDF]
J Inequal Appl, 2018 Sridhara G +3 more
europepmc +1 more source
On the characterization of claw-free graphs with given total restrained domination number. [PDF]
Springerplus, 2016 Pi X.
europepmc +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
Distance-based topological polynomials and indices of friendship graphs. [PDF]
Springerplus, 2016 Gao W +3 more
europepmc +1 more source
Disjoint Paired-Dominating sets in Cubic Graphs. [PDF]
Graphs Comb, 2019 Bacsó G, Bujtás C, Tompkins C, Tuza Z.
europepmc +1 more source
Bounds on the domination number and the metric dimension of co-normal product of graphs. [PDF]
J Inequal Appl, 2018 Javaid I, Ur Rehman S, Imran M.
europepmc +1 more source
Builder-Blocker Mutual-Visibility Game. [PDF]
Bull Malays Math Sci SocChenoweth VI +4 more
europepmc +1 more source
Locating-dominating number of certain infinite families of convex polytopes with applications. [PDF]
HeliyonHayat S, Kartolo N, Khan A, Alenazi MJF.
europepmc +1 more source