Author:
Campena ̃ Francis Joseph H.,G. Egan Ma. Christine,Antalan John Rafael M.
Abstract
In this study we define a graph operation on a finite simple graph G = (V, E) called the S-splitting graph of G where S is a non-empty subset of vertices of G. If S = V , then it is the splitting graph of G defined by E. Sampathkumar, and H.B. Walikar in the 1980’s. This paper investigates the Wiener and Harary indices of the S-splitting graph of G for some families of graph.
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献