Results 1  10
of
185
MATCHINGS AND TOTAL DOMINATION SUBDIVISION NUMBER IN GRAPHS WITH FEW INDUCED 4CYCLES
, 2010
"... A set S of vertices of a graph G = (V; E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domination number
t(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sd t(G) is the mi ..."
Abstract
 Add to MetaCart
A set S of vertices of a graph G = (V; E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domination number
t(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sd t
On the domination subdivision numbers of trees
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 46 (2010), PAGES 233–239
, 2010
"... A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set of G. The domination subdivision number of G is the minimum number of edges that must be subdivided (where eac ..."
Abstract
 Add to MetaCart
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set of G. The domination subdivision number of G is the minimum number of edges that must be subdivided (where
Trees with domination subdivision number one
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 42 (2008), PAGES 201–209
, 2008
"... The domination subdivision number sdγ(G) of a graph G is the minimum number of edges that must be subdivided to increase the domination number of G. We present a simple characterization of trees with sdγ =1 and a fast algorithm to determine whether a tree has this property. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The domination subdivision number sdγ(G) of a graph G is the minimum number of edges that must be subdivided to increase the domination number of G. We present a simple characterization of trees with sdγ =1 and a fast algorithm to determine whether a tree has this property.
Roman Subdivision Domination in Graphs
"... The subdivision graph ()S G of a graph G is the graph whose vertex set is the union of the set of vertices and the set of edges of G in which each edge uv is subdivided at once as uw and wv. A Roman dominating function on a subdivision graph ()S G H = is a function ( ) {}: 0,1,2f V H → satisfying ..."
Abstract
 Add to MetaCart
domination number of G and is denoted by ()RS Gγ. In this paper, we study the Roman domination in subdivision graph ()S G and obtain some results on ()RS Gγ in terms of vertices, blocks and other different parameters of the graph G, but not the members of ()S G. Further we develop its relationship with other
Trees whose domination subdivision number is one
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 40 (2008), PAGES 161–166
, 2008
"... A set S of vertices of a graph G = (V, E) is a dominating set if every vertex of V (G)\S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G. The domination subdivision number sdγ(G) is the minimum number of edges that must be subdivided (e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex of V (G)\S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G. The domination subdivision number sdγ(G) is the minimum number of edges that must be subdivided
Weakly connected domination subdivision numbers, Discuss
 Math. Graph Theory
"... A set D of vertices in a graph G = (V; E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G. The weakly connected domina ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
domination subdivision number of a connected graph G is the minimum number of edges that must be subdivided (where each egde can be subdivided at most once) in order to increase the weakly connected domination number. We study the weakly connected domination subdivision numbers of some families of graphs.
TREES WHOSE 2DOMINATION SUBDIVISION NUMBER IS 2
, 2012
"... Abstract. A set S of vertices in a graph G = (V, E) is a 2dominating set if every vertex of V \ S is adjacent to at least two vertices of S. The 2domination number of a graph G, denoted by γ2 (G), is the minimum size of a 2dominating set of G. The 2domination subdivision number sdγ 2 (G) is the ..."
Abstract
 Add to MetaCart
Abstract. A set S of vertices in a graph G = (V, E) is a 2dominating set if every vertex of V \ S is adjacent to at least two vertices of S. The 2domination number of a graph G, denoted by γ2 (G), is the minimum size of a 2dominating set of G. The 2domination subdivision number sdγ 2 (G
Strong weakly connected domination subdivisible graphs
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 47 (2010), PAGES 269–277
, 2010
"... The weakly connected domination subdivision number sdγw(G) ofaconnected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strongγ wsubdivisible if for each edge u ..."
Abstract
 Add to MetaCart
The weakly connected domination subdivision number sdγw(G) ofaconnected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strongγ wsubdivisible if for each edge
Fast Rendering of Subdivision Surfaces
, 1996
"... Subdivision surfaces provide a curved surface representation that is useful in a number of applications, including modeling surfaces of arbitrary topological type [5], fitting scattered data [6], and geometric compression and automatic levelofdetail generation using wavelets [8]. Subdivision sur ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
Subdivision surfaces provide a curved surface representation that is useful in a number of applications, including modeling surfaces of arbitrary topological type [5], fitting scattered data [6], and geometric compression and automatic levelofdetail generation using wavelets [8]. Subdivision
SketchBased Subdivision Models
 EUROGRAPHICS SYMPOSIUM ON SKETCHBASED INTERFACES AND MODELING (2009) C. GRIMM AND J. J. LAVIOLA JR. (EDITORS)
, 2009
"... Designing a control mesh (or a polyhedron) for a subdivision model is a tedious task. It involves many difficult decisions such as how to minimize the number of extraordinary vertices, how best to choose their valencies, and where to place them in the control mesh. In this paper, we present an intui ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Designing a control mesh (or a polyhedron) for a subdivision model is a tedious task. It involves many difficult decisions such as how to minimize the number of extraordinary vertices, how best to choose their valencies, and where to place them in the control mesh. In this paper, we present
Results 1  10
of
185