On the Kernel Eigenspace of Coalescence of Singular Graphs
DOI:
https://doi.org/10.5269/bspm.79934Abstract
A finite simple undirected graph is said to be singular if its adjacency matrix has eigenvalue 0.
If a vertex u in a graph G1 is identified with a vertex v in a graph G2, then the resulting graph G1 â—¦ G2, of
order |G1|+|G2|−1, is called the coalescence of G1 and G2 with respect to u and v. Singular graphs consist
of core and noncore vertices. In this paper, we coalesce two singular graphs and study the kernel eigenspace
of G1 â—¦G2, and based on this analysis, determine the core and noncore vertices of the coalesced graph.
Downloads
Published
2026-02-03
Issue
Section
Conf. Issue: International Conf. on Recent Trends in Appl. and Comput. Math.
License
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
