加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本