Home Articles List Article Information. Articles in Press. Current Issue.
Please take this quick survey to tell us about what happens after you publish a paper. Indian Journal of Pure and Applied Mathematics. In this paper, we introduce a new graph parameter called the domination defect of a graph.
Barman, S. Mondal and M. Pal, An efficient algorithm to find next-to-shortest path on permutation graphs, Journal of Applied Mathematics and Computing 31—
Scientific Research An Academic Publisher. Affiliation s. Also, we denote by V and E to order and size of graph G, respectively.
Vaidya and R. A dominating set is called a global dominating set if it is a dominating set of a graph G and its complement G. An equitable dominating set D of a graph G is a global equitable dominating set if it is also an equitable dominating set of the complement of G.
Skip to main content Skip to main navigation menu Skip to site footer. Keywords: dominating set, eternal dominating set, independent set, cubic graph, bipartite graph. Abstract Mobile guards on the vertices of a graph are used to defend the graph against an infinite sequence of attacks on vertices.
Use of this Web site signifies your agreement to the terms and conditions. Special Issues. Contact Us.
In this paper, we continue the study of domination and total domination in cubic graphs. It is known [Henning M. MSC: 05C