Pith. sign in

REVIEW 1 cited by

On the spectrum of closed neighborhood corona product of graph and its application

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.05653 v2 pith:FN7OKZEH submitted 2024-07-08 math.CO

classification math.CO
keywords productcoronagraphneighborhoodclosedgraphsinvestigatefurther
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we investigate the spectral properties of the closed neighborhood corona product of graphs, which was introduced by Harishchandra S. Ramane et al.~\cite{ramane2021polynomials} (cf. Polynomials Associated with Closed Neighborhood Corona and Neighborhood Complement Corona of Graphs). Based on their results, such as characteristic polynomials of the adjacency, Laplacian, and signless Laplacian matrices, we further investigate the spectral characteristics of this product graph. Specifically, we investigate conditions under which cospectrality occurs for this operation. Further, we determine the Kirchhoff index and count spanning trees and identify sequences of non-cospectral equienergetic product graphs. Finally, we develop criteria for when the product graph is integral and thereby contribute to a deeper understanding of the algebraic and combinatorial structure of the product graph.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Spectral Graph Determination

    math.CO 2024-12 conditional novelty 4.0 of 10

    A survey of spectral graph determination with new alternative proofs that Turán graphs and certain complete bipartite graphs are determined by their adjacency spectra.

Pith tools