Question

ring sum of graph g with it self is​

Answer 1

what is your question ?

no one will able to understand your question

Answer 2

Ring sum of graph g

• If a path in a graph G starts at vertex v and ends at vertex w, then the graph is said to be linked. Now that we have all the fundamental tools for graph theory, we can start formalising these ideas in an algebraic framework.
• A graph with no edges connecting its vertices is said to be null. An empty graph is another name for a null graph.
• For the graph G shown in Fig. 1, for instance, W (G) = 40 and W (G; q) = q 4 + 4q 3 + 8q 2 + 8q. 1 . A graph with the vertex set V (G) V (H) and edges that are either in G or H but not both is the ring sum of two graphs G and H.
• If the vertices of a graph G are labelled by separate positive integers such that the vertices labelled u and v are adjacent if and only if the vertex labelled u + v exists, then the graph G is a sum graph.

#SPJ2