Results 31 to 40 of about 263,414 (258)
Distance domination in partitioned graphs [PDF]
, 2006 Fu, Chin-Mei Kau, Vestergaard, Preben D.
core +2 more sources
The Semitotal Domination Problem in Block Graphs
Discussiones Mathematicae Graph Theory, 2022 A set D of vertices in a graph G is a dominating set of G if every vertex outside D is adjacent in G to some vertex in D. A set D of vertices in G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance 2
Henning Michael A. +2 more
doaj +1 more source
How changing physical constants and violation of local position invariance may occur? [PDF]
, 2007 Light scalar fields very naturally appear in modern cosmological models, affecting such parameters of Standard Model as electromagnetic fine structure constant $\alpha$, dimensionless ratios of electron or quark mass to the QCD scale, $m_{e,q}/\Lambda_ ...
E. V. Shuryak +4 more
core +2 more sources
Distance domination-critical graphs
Applied Mathematics Letters, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tian, Fang, Xu, Jun-Ming
openaire +1 more source
Unique Minimum Semipaired Dominating Sets in Trees
Discussiones Mathematicae Graph Theory, 2023 Let G be a graph with vertex set V. A subset S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distance two ...
Haynes Teresa W., Henning Michael A.
doaj +1 more source
Distance d-Domination Games [PDF]
, 2010 We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the robber is unknown to the cops, each cop can see a certain radius d around his position.
Stephan Kreutzer, Sebastian Ordyniak
openaire +1 more source
Zeroth-order general Randić index of trees with given distance k-domination number
Electronic Journal of Graph Theory and Applications, 2022 The zeroth-order general Randić index of a graph G is defined as Ra(G)=∑v ∈ V(G)dGa(v), where a ∈ ℝ, V(G) is the vertex set of G and dG(v) is the degree of a vertex v in G.
Tomas Vetrik +2 more
doaj +1 more source
The Numerical Invariants concerning the Total Domination for Generalized Petersen Graphs
Journal of Mathematics, 2020 A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to a vertex in S. The total domination number of a graph G denoted by γtG is the minimum cardinality of a total dominating set in G.
Taiyin Zhao +4 more
doaj +1 more source
Extremal values on Zagreb indices of trees with given distance k-domination number
Journal of Inequalities and Applications, 2018 Let G = ( V ( G ) , E ( G ) ) $G=(V(G),E(G))$ be a graph. A set D ⊆ V ( G ) $D\subseteq V(G)$ is a distance k-dominating set of G if for every vertex u ∈ V ( G ) ∖ D $u\in V(G)\setminus D$ , d G ( u , v ) ≤ k $d_{G}(u,v)\leq k$ for some vertex v ∈ D $v ...
Lidan Pei, Xiangfeng Pan
doaj +1 more source
Cosmology in a String-Dominated Universe [PDF]
, 1996 The string-dominated universe locally resembles an open universe, and fits dynamical measures of power spectra, cluster abundances, redshift distortions, lensing constraints, luminosity and angular diameter distance relations and microwave background ...
Bagla J. S. +12 more
core +3 more sources