Results 21 to 30 of about 1,516 (111)
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
, 2006 AMS classifications: 05C69; 90C35; 90C22;
de Klerk, E. +3 more
core +2 more sources
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
Discussiones Mathematicae Graph Theory, 2022 The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi +2 more
doaj +1 more source
Relating the super domination and 2-domination numbers in cactus graphs
Open Mathematics, 2023 A set D⊆V(G)D\subseteq V\left(G) is a super dominating set of a graph GG if for every vertex u∈V(G)\Du\in V\left(G)\setminus D, there exists a vertex v∈Dv\in D such that N(v)\D={u}N\left(v)\setminus D=\left\{u\right\}.
Cabrera-Martínez Abel +1 more
doaj +1 more source
Offensive alliances in cubic graphs [PDF]
, 2006 An offensive alliance in a graph $\Gamma=(V,E)$ is a set of vertices $S\subset V$ where for every vertex $v$ in its boundary it holds that the majority of vertices in $v$'s closed neighborhood are in $S$.
Rodriguez, J. A., Sigarreta, J. M.
core +3 more sources
(Independent) $k$-Rainbow Domination of a Graph
Turkish journal of mathematics & computer science, 2020 Let G = (V, E) be a graph with the vertex set V = V(G) and the edge set E = E(G). Let k be a positive integer and γrk(G) (γirk (G)) be k-rainbow domination (independent k-rainbow domination) number of a graph G.
D. Mojdeh, Zhila Mansouri
semanticscholar +1 more source
Hereditary Equality of Domination and Exponential Domination
Discussiones Mathematicae Graph Theory, 2018 We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.
Henning Michael A. +2 more
doaj +1 more source
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +1 more source
Connected 𝐷 - Eccentric Domination in Graphs
Indian Journal of Science and TechnologyObjectives: To introduce connected -eccentric point set, connected -eccentric number, connected -eccentric dominating set, connected -eccentric domination number in a graph and related concepts. Methods: -distance in graphs are used to find the connected
A. Prasanna, N. Mohamedazarudeen
semanticscholar +1 more source
A Note on the Locating-Total Domination in Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Miller Mirka +4 more
doaj +1 more source
On the general position number of two classes of graphs
Open Mathematics, 2022 The general position problem is to find the cardinality of the largest vertex subset SS such that no triple of vertices of SS lies on a common geodesic.
Yao Yan, He Mengya, Ji Shengjin
doaj +1 more source