[PDF] Top 20 Some results on subdivision graphs

... to some vertex in ...to some vertex in ...A subdivision of an edge e=uv of a graph G is the replacement of the edge e by a path ...the subdivision graph of G and is denoted by  ... See full document

... of graphs was first introduced by Rosa in 1961 [1] and ...Further some more results on mean graphs are discussed in [5, 6, 9, ...Also, some new results on odd mean graphs ... See full document

... Proof: In G, there are 7n+1 nodes, among which 3n nodes of valency five, 2n nodes of valency four, n nodes of valency six, n nodes of valency n+2 and one node of valency 2n. Thus by Handshaking lemma the total number of ... See full document

... The subdivision graph S(G) of a graph G is the graph obtained from G by replacing each of its edges by a path of length 2, or equivalently by inserting an additional vertex into each edge of ...G. ... See full document

... The subdivision graph is the graph obtained by inserting an additional vertex into each edge of G, denoted as S(G). The line graph, of a graph G is the graph whose vertices are the edges of the graph G, and two ... See full document

... Remark In the past few years, a number of upper bounds on the Estrada index of graphs have been established by using the algebraic techniques (see, for example, [, , , ]). In comparison to the algebraic ... See full document

... neutrosophic graphs were introduced by Broumi, Talea, Bakali and Smarandache ...proposed some algorithms dealt with shortest path problem in a network (graph) where edge weights are characterized by a ... See full document

... that subdivision of quadrilateral snakes, triangular snakes, Alternate triangular snakes, double triangular snakes, Alternate quadrilateral snakes, Double quadrilateral snakes, Double alternate triangular snakes, ... See full document

... 1.1. Signed Graphs and Their IASLs. A signed graph (see [15]), denoted by Σ(G, σ), is a graph G(V, E) together with a function σ : E(G) → {+, −} that assigns a sign, either + or −, to each ordinary edge in G. The ... See full document

... In the above labeling, see that the consecutive adjacent vertices having the labels even numbers and consecutive adjacent vertices having labels odd and even numbers contribute 1 to e[r] ... See full document

... give some general results about barycentric magic labeling for regular graphs and stars and solve the main problem for some graphs, particularly for graphs containing vertices of ... See full document

... path graphs, subdivision of comb graph, subdivision of ladder graph and the graph obtained by attaching star graph at one end of the path are SD-prime cordial ...cordial graphs need not be ... See full document

... which a graph G has a lucky edge labeling from the set {2, 3, . . , k} is the lucky number of G and is denoted by η(G). A graph which admits lucky edge labeling is the lucky edge labeled graph. In this paper, we show ... See full document

... We require G uv  to be isomorphic to G uv  . Let us consider the possible adjacencies in the graphs G, G uv  , G uv  . In graph G, for any two vertices u, v either, u and v are collectively adjacent to a ... See full document

... In 1736, Eular [9] introduced the concept of a graph. In 1965, Zadah [22] introduced the concept of fuzzy set which is an extension of crisp set. This concept developed a mathematical theory to deal uncertainty and ... See full document

... In this paper, we have introduced second and fourth multiplicative atom bond connectivity indices of a graph. We have computed the fourth multiplicative atom bond connectivity index of line graphs of ... See full document

... Varatharajan et al. [12] introduced the concept of divisor cordial labeling. Vaidya and shah [11] proved that some star and bistars related graphs are divisor cordial labeling. Deshmukh and Shaikh [10] ... See full document

... Two important aspects of graphs are partitions of vertex and edge sets into sets with prescribed properties. The first gives rise to different types of colorings and the second leads to decomposition in ... See full document

... define some notions of the graph theory. The subdivision graph S(G) is the graph obtained from G by replacing each of its edge by a path of length ... See full document

... when two vertices of a graph are identified. We also in- troduce a concept of strongly prime graph. As every prime graph is not a strongly prime graph it is very ex- citing to investigate graph families which are ... See full document