TITLE

On the Total {k}-Domination and Total {k}-Domatic Number of Graphs

AUTHOR(S)
ARAM, H.; SHEIKHOLESLAMI, S. M.; VOLKMANN, L.
PUB. DATE
January 2013
SOURCE
Asian Academy of Management Journal of Accounting & Finance;2013, Vol. 9 Issue 1, p39
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
For a positive integer k, a total {k}-dominating function of a graph G without isolated vertices is a function f from the vertex set V(G) to the set {0,1,2,...,k} such that for any vertex v ϵ V(G), the condition ΣuϵN(v) f (u) ⩾ k is fulfilled, where N(v) is the open neighborhood of v. The weight of a total {k}-dominating function f is the value ω(f) = ΣvϵV f(v). The total {k}-domination number, denoted by γ{k}t (G), is the minimum weight of a total {k}-dominating function on G. A set {f1, f2,…,fd} of total {k}-dominating functions on G with the property that Σdi=1 fi(v) ⩽ k for each v ϵ V(G), is called a total {k}-dominating family (of functions) on G. The maximum number of functions in a total {k}-dominating family on G is the total {k}-domatic number of G, denoted by d{k}t (G). Note that d{1}t (G) is the classic total domatic number dt (G). In this paper, we present bounds for the total {k}-domination number and total {k}-domatic number. In addition, we determine the total {k}-domatic number of cylinders and we give a Nordhaus-Gaddum type result.
ACCESSION #
88053625

 

Related Articles

  • ON LIST CHROMATIC NUMBER OF L(2, 0)-LABELING OF A COMPLETE BIPARTITE GRAPH K2,n. Sawitree Ranmechai; Kittikorn Nakprasit // Far East Journal of Mathematical Sciences;May2016, Vol. 99 Issue 10, p1571 

    For a graph G = (V, E), an L(i, j) -labeling is a function f from the vertex set V to the set of all nonnegative integers such that f (x) - f ( y) ≥ i if d(x, y) = 1 and ∣f (x) - f (y)∣ ≥ j if d(x, y) = 2, where d(x, y) denotes the distance between vertices x and y in G....

  • Counting k-gons in finite projective planes. Voropaev, A. N. // Sibirskie Elektronnye Matematicheskie Izvestiia;2013, Vol. 10, p241 

    In the study of combinatorial properties of finite projective planes, an open problem is to determine whether the number of k-gons in a plane depends on its structure. For the values of k = 3; 4; 5; 6, the number of k-gons is a function of plane's order q only. By means of the explicit formulae...

  • Congruences for a Certain Partition Function. Chen, Shi-Chao // Annals of Combinatorics;Dec2014, Vol. 18 Issue 4, p607 

    Let c( n) be the number of 4-colored partitions of n with two of the colors appearing only in multiples of 3. Chan and Cooper recently proved an infinite family of congruences for c( n). We prove more congruences by the theory of modular forms.

  • Weak partition properties on trees. Hrušák, Michael; Simon, Petr; Zindulka, Ondřej // Archive for Mathematical Logic;Aug2013, Vol. 52 Issue 5/6, p543 

    We investigate the following weak Ramsey property of a cardinal κ: If χ is coloring of nodes of the tree κ by countably many colors, call a tree $${T \subseteq \kappa^{ < \omega}}$$ χ-homogeneous if the number of colors on each level of T is finite. Write $${\kappa \rightsquigarrow...

  • Upper Singed Domination Number of Graphs. Walikar, H. B.; Motammanavar, Satish V.; Venkatesh, T. // International Journal of Mathematical Combinatorics;Mar2014, Vol. 1, p87 

    A function f : V (G) → {-1, 1} defined on the vertices of a graph G is a signed dominating function (SDF) if f(N[v]) ⩾ 1, ∀ v ϵ V , where N[v] is the closed neighborhood of v. A SDF f is minimal if there does not exists signed dominating function g, g ≠ f such that...

  • Chromatic Polynomials of Complements of Bipartite Graphs. Bohn, Adam // Graphs & Combinatorics;Mar2014, Vol. 30 Issue 2, p287 

    We define a biclique to be the complement of a bipartite graph, consisting of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic polynomial of an arbitrary biclique, and use this to...

  • Set Ideals with Complete Symmetry Group and Partition Ideals. Mishkin, Valery // Bulletin of the London Mathematical Society;1999, Vol. 31 Issue 6, p649 

    For a wide class of set ideals (including, for example, all uniform ideals), a criterion of completeness of their symmetry groups is provided in terms of ideal quotients (polars). We apply it to partition ideals, and derive the extended Sierpiński–Erdös duality principle. We...

  • OPTIMAL ORIENTATIONS OF SUBGRAPHS OF COMPLETE BIPARTITE GRAPHS. LAKSHMI, R.; RAJASEKARAN, G.; SAMPATHKUMAR, R. // Transactions on Combinatorics;Mar2015, Vol. 4 Issue 1, p19 

    For a graph G, let D(G) be the set of all strong digraphs D obtained by the orientations of G: The orientation number of G is → d(G) = min {d(D) ∣ D ϵ D(G)}, where d(D) denotes the diameter of the digraph D: In this paper, we determine the orientation number for some subgraphs of...

  • A Matrix Model with a Singular Weight and Painlevé III. Brightmore, L.; Mezzadri, F.; Mo, M. // Communications in Mathematical Physics;Feb2015, Vol. 333 Issue 3, p1317 

    We investigate the matrix model with weight and unitary symmetry. In particular we study the double scaling limit as $${N \to \infty}$$ and $${(\sqrt{N} t, Nz^2 ) \to (u_1,u_2)}$$ , where N is the matrix dimension and the parameters ( u, u) remain finite. Using the Deift-Zhou steepest descent...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics