
A coloring of a graph [Formula: see text] is the assignment of colors to the vertices of [Formula: see text] such that no two adjacent vertices receive the same color. The minimum number of colors required to color [Formula: see text] is said to be the chromatic number of [Formula: see text], and is denoted by [Formula: see text]. A subset [Formula: see text] of [Formula: see text] is said to be a dominating set of [Formula: see text] if every vertex in [Formula: see text] is adjacent to some vertex in [Formula: see text]. If the graph induced on [Formula: see text] has no isolates, the [Formula: see text] is said to be a total dominating set of [Formula: see text]. The minimum cardinality of a dominating (total dominating) set of [Formula: see text] is said to be the domination (total domination) number of [Formula: see text], and is denoted by [Formula: see text] ([Formula: see text]). For a graph [Formula: see text] without isolated vertices, a total gamma coloring is a coloring of [Formula: see text], if there is a total dominating set [Formula: see text] of [Formula: see text] such that all vertices in [Formula: see text] receive distinct colors. The minimum number of colors required for a total gamma coloring of [Formula: see text] is called the total gamma chromatic number, and is denoted by [Formula: see text]. In this paper, we investigate [Formula: see text] number of graphs, bounds in terms of chromatic number and total domination number, and characterization of extremal graphs attaining a given [Formula: see text] number.
In this paper, we construct the current graph and pentagonal rule of the complete graph pentagonal embedding, and prove that the complete graph K 31 has at least 663552 nonisomorphic orientable pentagonal embeddings. Each embedding has 720 5-edge colorings, and each coloring appears on each face of the orientable pentagonal embeddings. For all pentagonal embeddings in the orientable surface 𝒮 125 , these embeddings determine polyhedra with a minimal number of pentagons. We also establish similar results for the complete graph K 11 .
Let [Formula: see text] be a non-abelian finite-dimensional Lie algebra and [Formula: see text] be its centre. Then the non-commuting graph of the Lie algebra [Formula: see text] is defined as an undirected simple graph whose vertex set is [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In this paper, we consider all Lie algebras [Formula: see text] with [Formula: see text] and draw the non-commuting graph of such Lie algebras. Also, we determine some graph properties of these kinds of graphs such as maximum and minimum degrees, planarity, outer planarity, independence, domination, clique and chromatic numbers. Moreover, the structures of non-commuting graphs of a Lie algebra [Formula: see text] with a given minimum degree are explained. Some upper and lower bounds for invariant parameters are stated, and the structure of regular non-commuting graphs of Lie algebras is determined at the end.
For a connected graph [Formula: see text], two vertices [Formula: see text] are doubly resolved by [Formula: see text] if [Formula: see text]. The doubly metric dimension of a connected graph [Formula: see text] is defined as the cardinality of a minimum set of vertices that doubly resolves every pair of vertices in [Formula: see text]. It has been shown that the doubly metric dimension problem is NP-hard. In this paper, we study the doubly metric dimensions of some 3-connected plane graphs: the convex polytopes [Formula: see text], [Formula: see text] and [Formula: see text], and we also determine the doubly metric dimensions of their related plane graphs [Formula: see text], [Formula: see text] and [Formula: see text].
Sensor coverage is a fundamental problem in wireless networks. This paper investigates the Minimum Power Partial Multi-Cover problem on a Line (MinPowPMC-L). The objective is to allocate power to sensors such that a specified number of target points have their (multi-)coverage requirements satisfied and the total power is minimized. We identify a flaw in a previous work and correct it by proposing a dynamic programming algorithm that runs in polynomial time under the assumption that the maximum coverage requirement is upper bounded by a constant.