Abstract
Network science and graph theory are two important branches of mathematics and computer science. Many problems in engineering and physics are modeled with networks and graphs. Topological analysis of networks enable researchers to analyse networks in relation some physical and engineering properties without conducting expensive experimental studies. Topological indices are numerical descriptors which defined by using degree, distance and eigen-value notions in any graph. Most of the topological indices are defined as by using classical degree concept in graph theory, network and computer science. Recently two novel degree parameters have been defined in graph theory: Vertex-edge degree and Edge-vertex degree. Vertex-edge degree and edge-vertex degree based topological indices have been defined as parallel to their corresponding classical degree counterparts. Generalized Sierpinski networks have an important place of applications in view of engineering science especially in computer science. Classical degree based topological properties of generalized Sierpinski graphs have been investigated by many studies. In this article, vertex-edge degree based topological indices values of generalized Sierpinski graphs have been computed.
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 callMore From: Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Disclaimer: 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.
