Total dominator chromatic number of some operations on a graph
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2018, Vol 6, Issue 2
Abstract
Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number Χ<sup>t</sup><sub>d</sub>(<i>G</i>) of <i>G</i> is the minimum number of colors among all total dominator coloring of <i>G</i>. In this paper, we examine the effects on Χ<sup>t</sup><sub>d</sub>(<i>G</i>) when <i>G</i> is modified by operations on vertex and edge of <i>G</i>.
Authors and Affiliations
Nima Ghanbari, Saeid Alikhani
Keywords
Related Articles
- EP ID EP478773
- DOI -
- Views 60
- Downloads 0
Loop topological complexity
We introduce here the notion of loop motion planning algorithms and show that it yields to a homotopical invariant: the loop topological complexity, denoted throughout this paper by $\rm{TC}^{\rm{LP}}(-)$, which measures...
Some Convergence Strategies for the Alternating Generalized Projection Method
In this paper we extend the application of the alternating projection algorithm to solve the problem of finding a point in the intersection of $n$ sets ($n\geq2$), which are not all of them convex sets. Here we term such...
Quadrature formulae of Euler-Maclaurin type based on generalized Euler polynomials of level m
This article deals with some properties -which are, to the best of our knowledge, new- of the generalized Euler polynomials of level $m$. These properties include a new recurrence relation satisfied by these polynomials...
On the Modified Methods for Irreducible Linear Systems with L-Matrices
Milaszewicz, [Milaszewic J.P, Linear Algebra. Appl. 93,1987, 161$-$170] presented new preconditioner for linear system in order to improve the convergence rates of Jacobi and Gauss-Seidel iterative methods. Li et al.,[Li...
Motion planning algorithms, topological properties and affine approximation
The topological study of the so-called "motion planning algorithms" emerged in the 2003-2004 with the works of M. Farber. We focus here on the topological study of the set of these algorithms, when the configuration spac...