Abstract
Let G be a simple undirected graph. Three new corona products of graphs based on splitting graph of G are defined. The adjacency spectra of the three new graphs based on splitting graph of G are determined. The number of spanning trees and the Kirchoff index of the new graphs are determined using their nonzero Laplacian eigenvalues.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Discrete mathematics, algorithms, and applications
Paper Title
Journal
Date
