3 research outputs found

    Coronas and domination subdivision number of a graph

    Full text link
    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

    Full text link
    The domination multisubdivision number of a nonempty graph GG was defined as the minimum positive integer kk such that there exists an edge which must be subdivided kk times to increase the domination number of GG. Similarly we define the total domination multisubdivision number msdγt(G)_{\gamma_t}(G) of a graph GG and we show that for any connected graph GG of order at least two, msdγt(G)≤3._{\gamma_t}(G)\leq 3. 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 TT with msdγt(T)=1_{\gamma_t}(T)=1.Comment: 15 pages, 1 figure, 9 reference

    Critical graphs upon multiple edge subdivision

    Full text link
    A subset DD of VV is \emph{dominating} in GG if every vertex of V−DV-D has at least one neighbour in D;D; let γ(G)\gamma(G) be the minimum cardinality among all dominating sets in G.G. A graph GG is γ\gamma-qq-{\it critical} if the smallest subset of edges whose subdivision necessarily increases γ(G)\gamma(G) has cardinality q.q. In this paper we consider mainly γ\gamma-qq-critical trees and give some general properties of gammagamma-qq-critical graphs. In particular, we show that if TT is a γ\gamma-qq-critical tree, then 1≤q≤n(T)−11 \leq q \leq n(T)-1 and we characterize extremal trees when q=n(T)−1.q=n(T)-1. Since a subdivision number {of a tree TT} sd(T){\rm sd}(T) is always 1,21,2 or 3,3, we also characterize γ\gamma-2-critical trees TT with sd(T)=2{\rm sd}(T)=2 and γ\gamma-3-critical trees TT with sd(T)=3.{\rm sd}(T)=3.Comment: 11 pages, 1 figur
    corecore