Spectra of T-vertex and T-edge neighbourhood corona of Two Graphs

Abstract

The T-graph T(G) of a graph G is the graph whose vertices are the vertices and edges of G, with two vertices of T(G) are adjacent if and only if the corresponding elements of G are adjacent or incident. In this paper, we determine the adjacency and Laplacian spectra of T-vertex neighborhood corona and T-edge neighborhood corona of a connected regular graph with an arbitrary regular graph in terms of their eigenvalues. Moreover, applying these results we construct some non-regular A-cospectral and L-cospectral graphs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…