The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete ...
The Complement graph algorithm constructs a new graph where the edges of the original graph are reversed. If an edge exists between vertices A and B in the original graph, it will be removed, and a ...
Abstract: The Kron reduction in the original presentation of Kron and the modern interpretation of the Kron reduction in the context of graph theory and applications are presented. An interpretation ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback