subdivision graph

subdivision graph

[′səb·di‚vizh·ən ‚graf]
(mathematics)
A graph which can be obtained from a given graph by breaking up each edge into one or more segments by inserting intermediate vertices between its two ends.
References in periodicals archive ?
The super subdivision graph S (G) is obtained from G by replacing every edge e of G by a complete bipartite graph K2,m (m 2) in such a way that the ends of e are merged with the two vertices of the 2-vertices part of K2,m after removing the edge e from G.
2 [3] The super subdivision graph Cn is vertex equitable if n 0 or 3(mod4) ,.
1: The super subdivision graph S (Pn K1) is a vertex equitable graph.
The super subdivision graph S (B(n ,n)) is a vertex equitable graph.
The vertex equitable labeling of the super subdivision graph S (B(2,2)) is given in Figure 2.
The subdivision graph S(G) of a graph G is obtained by replacing each edge uv by a path uwv.
triangular snake, triangular snakes, quadrilateral snakes, (Equation) if and only if n less than 3, (Equation) if and only if n less than 3, bistars (Equation) if and only if m less than n+2, the subdivision graph of the star (Equation) if and only if n less than 4, and the friendship graph (Equation) if and only if t less than 2.
The subdivision graph S(G) is the graph obtained from G by replacing each of its edge by a path of length 2, or equivalently by inserting an additional vertex into each edge of G [11].
This section deals with the bounds for the laplacian energy and the largest eigen value of the line graph of the subdivision graph of the tadpole graph, wheel graph, complete graph and ladder graph.
The cardinality of the subdivision graph of the tadpole graph [T.
2 the Laplacian energy of the line graph of the subdivision graph of the tadpole graph [T.
1, the number of edges in the line graph of the subdivision graph of the tadpole graph