[PDF] Top 20 Signed Dominating and Total Dominating Functions of Corona Product Graph of a Path with a Star

... of Graph Theory that has a wide range of applications to many fields like Engineering, Communication Networks, Social sciences, linguistics, physical sciences and many ...Recently, dominating ... See full document

... of total dominating functions of corona product graph of a cycle with a complete graph is studied and some results on minimal total dominating ... See full document

... Graph Theory has been realized as one of the most useful branches of Mathematics or recent origin, finding widest applications in all most all branches of Sciences, Engineering and Computer Science. An ... See full document

... Graph theory is one of the most flourishing branches of modern mathematics and computer science. Domination in graphs has been studied extensively in recent years and it is an important branch of graph ... See full document

... Abstract: Graph theory is an interesting subject in ...of graph theory. In this paper, we study the maximal inverse signed dominating functions of corona product ... See full document

... of corona product graph are studied by Anita [2] and some results on minimal edge dominating sets and functions of this graph are presented in ...on signed and Roman edge ... See full document

... minimal dominating functions of corona product graph of a cycle with a complete graph are presented in ...as signed domination, minus domination, efficient minus ... See full document

... of corona product graphs arising from standard graphs is ...Edge dominating functions, signed edge dominating functions and Roman edge dominating functions ... See full document

... in graph theory and in recent years it has been studied ...6]. Dominating sets have applications in diverse areas such as logistics and Communication Networks design, mobile computing, resource allocation ... See full document

... Graph Theory has been realized as one of the most flourishing branches of Mathematics of recent origin with wide applications to combinatorial problems and to classical algebraic problems. The theory of domination ... See full document

... about total domination in graphs. Total roman domination which is suggested by the article in “Total Roman domination in graphs” by Ahangar, Henning, Samodivkin & Yero ...of signed ... See full document

... various graph theoretic properties and domination parameters of corona product graph of a cycle with a ...Edge dominating functions and total edge dominating ... See full document

... of signed Roman dominating function was introduced by Ahangar et ...the signed Roman domination number of a graph and characterized the graphs which have these ...minimal signed Roman ... See full document

... connected graph of order . The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge ... See full document

... undirected graph without isolated ...of dominating color transversal sets of a ...on Total Domination ...of graph G partitions the vertex set V of G into equivalence classes (also called the ... See full document

... connected graph of order . The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge ... See full document

... network graph. Using maximal independent sets, the dominating set and connectors for the dominating set in the network graph is find ...these dominating set and connectors the connected ... See full document

... Interval graphs have drawn the attention of many researchers for over 40 years. They form a special class of graphs with many interesting properties and revealed their practical relevance for modeling problems arising in ... See full document

... Definition 2.3. [2] (Complementary n-coloring) A coloring of a graph G is called a complementary coloring of G if whenever two vertices u and v have distinct colors then u and v are adjacent. An n– coloring which ... See full document

... interval graph are one and the same thing. The graph G is connected and the list of sorted end point is given and the intervals in I are indexed by increasing right end points, that ... See full document