Abstract
A blowup of a graph Γ with respect to a graph Γ′ is the graph ΓΓ′ obtained from Γ by replacing every vertex u of Γ with a disjoint copy Γu′ of Γ′ and attach every vertex of Γu′ to every vertex of Γv′ if there is an edge between u and v in Γ. Accordingly, a P-blowup of a graph Γ is a Γ′-blowup of Γ with Γ′ being a P-graph for a graph-theoretical property P. We present combinatorial interpretations of Moore–Penrose inverses of incidence matrices of independent-blowups and clique-blowups of trees and apply them to obtain formulas for resistance distances between vertices of the corresponding blowup graphs as well as their Kirchhoff indices. Also, we give some results on arbitrary blowups of graphs as well.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
