969 research outputs found
On total domination vertex critical graphs of high connectivity
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domination number, while a graph with no isolated vertex is γt-critical if the removal of any vertex that is not adjacent to a vertex of degree 1 decreases the total domination number. A γt-critical graph that has total domination number k, is called k-γt-critical. In this paper, we introduce a class of k-γt-critical graphs of high connectivity for each integer k≥3. In particular, we provide a partial answer to the question “Which graphs are γ-critical and γt-critical or one but not the other?” posed in a recent work [W. Goddard, T.W. Haynes, M.A. Henning, L.C. van der Merwe, The diameter of total domination vertex critical graphs, Discrete Math. 286 (2004) 255–261]
On Murty-Simon Conjecture II
A graph is diameter two edge-critical if its diameter is two and the deletion
of any edge increases the diameter. Murty and Simon conjectured that the number
of edges in a diameter two edge-critical graph on vertices is at most
and the extremal graph is the complete
bipartite graph .
In the series papers [7-9], the Murty-Simon Conjecture stated by Haynes et al.
is not the original conjecture, indeed, it is only for the diameter two
edge-critical graphs of even order. In this paper, we completely prove the
Murty-Simon Conjecture for the graphs whose complements have vertex
connectivity , where ; and for the graphs whose
complements have an independent vertex cut of cardinality at least three.Comment: 9 pages, submitted for publication on May 10, 201
3-Factor-criticality in double domination edge critical graphs
A vertex subset of a graph is a double dominating set of if
for each vertex of , where is the set of the
vertex and vertices adjacent to . The double domination number of ,
denoted by , is the cardinality of a smallest double
dominating set of . A graph is said to be double domination edge
critical if for any edge . A double domination edge critical graph with is called --critical. A graph is
-factor-critical if has a perfect matching for each set of
vertices in . In this paper we show that is 3-factor-critical if is
a 3-connected claw-free --critical graph of odd order
with minimum degree at least 4 except a family of graphs.Comment: 14 page
Critical Pebbling Numbers of Graphs
We define three new pebbling parameters of a connected graph , the -,
-, and -critical pebbling numbers. Together with the pebbling number, the
optimal pebbling number, the number of vertices and the diameter of the
graph, this yields 7 graph parameters. We determine the relationships between
these parameters. We investigate properties of the -critical pebbling
number, and distinguish between greedy graphs, thrifty graphs, and graphs for
which the -critical pebbling number is .Comment: 26 page
- …