[PDF] Top 20 Some cycle and path related strongly*-graphs

... Abstact —A graph with n vertices is said to be strongly ∗ -graph if its vertices can be assigned the values {1, 2, . . . , n} in such a way that when an edge whose end vertices are labeled i and j, is labeled with ... See full document

... NellaiMurugan, Near Mean Cordial-Path Related Graphs, International Journal Of Scientific Research and Development Vol.. Nagarajan, Cycle and Path Related Near Mean Cordial Graphs,.[r] ... See full document

... for some graphs like path, cycle and star graph are ...a cycle with odd number of nodes is a fuzzy magic graph.And also some properties related to fuzzy bridge and fuzzy ... See full document

... number of stars, double stars, cycles, paths, complete graphs and complete bipartite graphs are determined. Also in [3] (H. Escuardo, Ping Zhang) they establish a formulae for the detection number of ... See full document

... Selvaraj, Cycle and Armed Cup cordial graphs, International Journal of Innovative Science, Engineering & Technology , ISSN ...G.Esther, Some Results on Mean ... See full document

... of path, cycle, star, bistar, some complete graphs, comb, double comb, triangular snake, double triangular snake, ladder, friendship graph, flower graph, gear graph, Jelly fish, book, ... See full document

... Graphs considered here are finite and simple. Recently Ponraj, Maria Adaickalam and Kala [3] have introduced the k-difference cordial labeling of graphs. In [3], they investigate the k-difference cordial ... See full document

... of cycle Cn . Vaidya and Barasara[6] have proved that the cycle with one chord, the cycle with twin chords, the friendship graph and the middle graph of path admit product cordial labeling ... See full document

... All graphs considered here are finite, simple and ...A path related relaxed cordial graphs were introduced by ...prove some standard graphs such as path, cycle, ... See full document

... of some standard ...H- related graphs has been studied in ...of path related graphs is investigated in ...and cycle related graphs, Prime labeling of ... See full document

... The concept of detour distance was introduced by Char- trand et al. in [4, 5] while several results concerning detour distance and detour graphs are derived by Chartrand et al. [3]. Chartrand and Zhang [6] have ... See full document

... Abstract. An edge labeling of a graph is a bijection from E(G) to the set {1,2,… , |E(G)|}. If for any two distinct vertices u and v, the sum of labels on the edges incident to u is different from the sum of labels on ... See full document

... The first definition of fuzzy graph by Kaufmann was based on Zadeh’s fuzzy relations. After that Rosenfield considered fuzzy relation on fuzzy sets and developed the structure of fuzzy graphs. After the work of ... See full document

... All graphs considered here are finite, simple and undi- rected. The origin of graph labelings can be attributed to Rosa. Several types of graph labeling have been investi- gated both from a purely combinatorial ... See full document

... in graphs. The strong domination number of some standard graphs are already available in the literature while we have investigated the strong domination number for corona product and corona like ... See full document

... For general notation and concepts in graphs see [1, 2, 5]. It is assumed that the reader is familiar with the concept of graph coloring. Recall that in a proper coloring of G all edges are good i.e. uv ⇔ c(u) 6= ... See full document

... Keywords Graph, Path, Cycle, Degree Splitting Graphs, Root Square Mean Graphs, Union of Graphs.. Introduction The graphs considered here are simple, finite and undirected.[r] ... See full document

... The graphs we consider are finite, connected, and simple and un- directed. We refer F.Harary[4], Dynamic survey of graph labeling [3] for definitions and terminology. Deretsky, Lee, Mitchem Proposed a labeling ... See full document

... Throughout this paper, only finite, undirected and simple graphs are considered. The concept of domination in graphs was introduced by Ore. Two volumes on domination have been published by T.W.Haynes, ... See full document

... Abstract: Square sum difference product prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with absolute difference of the sum of the squares of the labels of the incident ... See full document