Results 61 to 70 of about 1,270 (74)

On (k1A1, k2A2, k3A3)-Edge Colourings in Graphs and Generalized Jacobsthal Numbers

open access: yesAnnales Mathematicae Silesianae
In this paper we introduce a new kind of generalized Jacobsthal numbers in a distance sense. We give the identities and matrix representations for them and their connections with the Fibonacci and the Pell numbers. We also describe the interpretations of
Piejko Krzysztof, Trojnar-Spelina Lucyna
doaj   +1 more source

On The Co-Roman Domination in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Let G = (V, E) be a graph and let f : V (G) → {0, 1, 2} be a function. A vertex v is said to be protected with respect to f, if f(v) > 0 or f(v) = 0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function if (i)
Shao Zehui   +4 more
doaj   +1 more source

Cubic Graphs with Total Domatic Number at Least Two

open access: yesDiscussiones 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

Improved McClelland and Koolen-Moulton bounds for distance energy of a graph. [PDF]

open access: yesJ Inequal Appl, 2018
Sridhara G   +3 more
europepmc   +1 more source

Distance-based topological polynomials and indices of friendship graphs. [PDF]

open access: yesSpringerplus, 2016
Gao W   +3 more
europepmc   +1 more source

Disjoint Paired-Dominating sets in Cubic Graphs. [PDF]

open access: yesGraphs Comb, 2019
Bacsó G, Bujtás C, Tompkins C, Tuza Z.
europepmc   +1 more source

Home - About - Disclaimer - Privacy