5 papers
The P-vertex problem for graphs with perfect matchings
G. Arunkumar, U. S. Jerisha
Sharma and Panda recently proved that every bipartite graph with a perfect matching has property (P); that is, it admits a non-singular real symmetric matrix with support graph G f…
The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs
G. Arunkumar, Puja Samanta
In a recent work, Sharma and Panda~\cite{sharma} showed that every bipartite graph with a perfect matching has property (P), and proved the converse for trees and unicyclic biparti…
Main functions and the spectrum of super graphs
G. Arunkumar, Peter J. Cameron, R. Ganeshbabu +1
Let A be a graph type and B an equivalence relation on a group . Let be the equivalence class of with respect to the equivalence relation B. The B superA graph of …
On the spectrum of generalized H-join operation constrained by indexing maps -- I
R. Ganeshbabu, G. Arunkumar
Fix . A new generalization of the -join operation of a family of graphs constrained by indexing maps is introduce…
Super graphs on groups, II
G. Arunkumar, Peter J. Cameron, Rajat Kanti Nath
In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting g…