[PDF] Top 20 Some Variations of Y Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph

... Recently, dominating functions in domination theory have received much ...purely graph – theoretic motivation is given by the fact that the dominating function problem can be seen, in a clear ... See full document

... studied some dominating functions of corona product graph of a cycle with a complete graph [9] and published papers on minimal dominating ... 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

... Recently, dominating functions in domination theory have received much ...purely graph – theoretic motivation is given by the fact that the dominating function problem can be seen, in a clear ... 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

... line dominating sets and obtained bounds for the line domination ...edge dominating set problem is NP-complete even when restricted to planar or bipartite graphs of maximum ... See full document

... The theory of domination in graphs has a wide range of applications. Among these applications, the most often discussed is a communication network. This network consists of communication links between a fixed set of ... 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

... Abstract: Graph theory is an interesting subject in ...signed dominating functions of corona product graph of a path with a complete graph and rooted product ... See full document

... The bipartite graphs with equal edge domination number and maximum matching cardinality are characterized by Dutton and Klostermeyer [9] while Yannakakis and Gavril [17] have shown that edge dominating set problem ... See full document

... Domination in graphs has been studied extensively in recent years. It is introduced by Ore [20] and Berge [8] and has become an emerging area of research in graph theory today. Many graph theorists, Allan, ... See full document

... Many real-life situation can be described by means of a diagram consisting of a set of points with lines joining certain pairs of points. In the recent years, many studies tend to find a relation between group theory and ... See full document

... The graph obtained by vertex switching of the apex vertex in the gear graph again yields us a gear ...gear graph is a product cordial graph if n is odd and it is not a product ... See full document

... from last group and from last group select last two vertices. The resultant set, say S, will be a total dominating set with cardinality ௡ିଷ ଶ + 2 = ௡ାଵ ଶ . Consider the ૏ − coloring of vertices of each group by ... See full document

... other graph valued functions in domination theory were studied, for example, in [ 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21] and also graph valued functions in graph theory ... See full document

... Restrained dominating set of an Interval graph G , if every vertex not in D is adjacent to a vertex in D and to a vertex in V  D ...In graph theory, a connected component of an undirected ... See full document

... A chord of a path P is an edge joining two non-adjacent vertices of P . A path P is called a monophonic path if it is a chordless path. A longest x − y monophonic path is called an x − y detour monophonic ... See full document

... for the energy of a forest from which some known results of trees can be improved. Gopalapillai et al [4] obtained bounds for the distance spectral radius and D-energy of graphs of diameter 2. They also ... See full document

... For connected graphs G and H, Graham conjectured that π(G H) ≤ π(G)π(H) where π(G), π(H), and π(G H) are the pebbling numbers of G, H, and the Cartesian product G H, respectively. In this paper, we show that the ... See full document

... not product cordial.Vaidya and Barasara[9],[10],[11],[12]discuss product cordiality of closed helms, web graphs, ower graphs, double triangular snakes obtained from the path Pn if and only if n is odd, and ... See full document