Abstract
Let and be two graphs with disjoint vertex sets and . Let and . A splice of and by vertices and , , is defined by identifying the vertices and in the union of and . In this paper we calculate the Szeged, edge-Szeged, , vertex- and eccentric connectivity indices of splice graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.