3 research outputs found
Coronas and domination subdivision number of a graph
In this paper, for a graph G and a family of partitions P of vertex
neighborhoods of G, we define the general corona G \circ P of G. Among several
properties of this new operation, we focus on application general coronas to a
new kind of characterization of trees with the domination subdivision number
equal to 3.Comment: 9 pages, 4 figure
Total domination multisubdivision number of a graph
The domination multisubdivision number of a nonempty graph was defined as
the minimum positive integer such that there exists an edge which must be
subdivided times to increase the domination number of . Similarly we
define the total domination multisubdivision number msd of a
graph and we show that for any connected graph of order at least two,
msd We show that for trees the total domination
multisubdivision number is equal to the known total domination subdivision
number. We also determine the total domination multisubdivision number for some
classes of graphs and characterize trees with msd.Comment: 15 pages, 1 figure, 9 reference
Critical graphs upon multiple edge subdivision
A subset of is \emph{dominating} in if every vertex of has
at least one neighbour in let be the minimum cardinality among
all dominating sets in A graph is --{\it critical} if the
smallest subset of edges whose subdivision necessarily increases
has cardinality In this paper we consider mainly --critical
trees and give some general properties of --critical graphs. In
particular, we show that if is a --critical tree, then and we characterize extremal trees when Since a
subdivision number {of a tree } is always or we
also characterize -2-critical trees with and
-3-critical trees with Comment: 11 pages, 1 figur