Results 31 to 40 of about 8,714,403 (56)
, 2005 For a finite undirected graph G on n vertices two continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the domination number γ of G.
Harant, Jochen, Göring, Frank
core +2 more sources
On graphs for which the connected domination number is at most the total domination number [PDF]
, 2012 In this note, we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is
Schaudt, Oliver
core +1 more source
On domination number of 4-regular graphs [PDF]
, 2004 summary:Let $G$ be a simple graph. A subset $S \subseteq V$ is a dominating set of $G$, if for any vertex $v \in V~- S$ there exists a vertex $u \in S$ such that $uv \in E (G)$.
Liu, Hailong, Sun, Liang
core +1 more source
The study of Roman domination number
, 2015 碩士在一個圖G=(V,E)上， 定義一個函數 f 將V對應到{0, 1, 2}，假如f滿足每一個對應到0 的點都有一個對應到2的鄰居，函數 f 稱為羅馬控制函數。函數f的權重為圖中所有點相應的權重總和，而所有可能的羅馬控制函數中權重最小者稱為圖 G 的羅馬控制數。一個蜘蛛圖 G(k_1,k_2,k_3,…,k_t )為含有共同端點的t個路徑〖 P〗_(k_1 ), 〖 P〗_(k_2 ), …, 〖 P〗_(k_t )所形成的圖。一個一般蜘蛛圖〖 C〗_t (k_1,k_2,k_3,…,k_t ...
許智雄; Xu, Zhi-Xiong
core
Signed total domination number of a graph [PDF]
, 2001 summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core +1 more source
When the connected domination number is at most the total domination number [PDF]
, 2011 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core +2 more sources
DOMINATION POLYNOMIALS: A BRIEF SURVEY AND ANALYSIS
, 2017 A dominating set S of a graph G of order n is a subset of the vertices of G such that every vertex is either in S or adjacent to a vertex of S. The domination polynomial of G, denoted D(G, x), is the generating polynomial for the number of dominating ...
Beaton, Iain
core
On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]
, 2012 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A survey of selected recent results on total domination in graphs
Discrete Mathematics, 2009Michael Henning
exaly