Results 81 to 90 of about 477 (116)

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

Springerplus, 2016
Gao W, Farahani MR, Imran M, Rajesh Kanna MR.   +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 Soc
Chenoweth VI, Klavžar S, Rus G, Tan E, Tian J.   +4 more
europepmc   +1 more source

Locating-dominating number of certain infinite families of convex polytopes with applications. [PDF]

Heliyon
Hayat S, Kartolo N, Khan A, Alenazi MJF.
europepmc   +1 more source

The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets. [PDF]

Ann Math Sil
Brewster RC, Mynhardt CM, Teshima LE.
europepmc   +1 more source

Hypergraphs with large transversal number and with edge sizes at least four

Open Mathematics, 2012
Henning Michael, Löwenstein Christian
doaj   +1 more source

A lower bound for the packing chromatic number of the Cartesian product of cycles

Open Mathematics, 2013
Jacobs Yolandé, Jonck Elizabeth, Joubert Ernst   +2 more
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Domination defect for the join and corona of graphs

Applied Mathematical Sciences, 2021
The domination number of a graph G denoted by γ(G) is the minimum number of vertices required to dominate all the vertices of G. The minimality of γ(G) implies that if W ⊆ V (G) such that |W | < γ(G), then there is at least one vertex of G that is not ...
Aldwin T. Rolito G. Eballe, R. Eballe
semanticscholar   +1 more source

Weakly connected 2-domination in graphs

Applied Mathematical Sciences, 2021
Let G = (V (G), E(G)) be a connected graph. A set D ⊆ V (G) is a weakly connected 2-dominating set if every vertex of V (G)\D is adjacent to at least two vertices in D and the subgraph 〈D〉w weakly induced by D is connected.
Mae P. Militante
semanticscholar   +1 more source