Distance in Degree Splitting Graphs

Abstract

For a graph G(V,E), if Videnote the set of all vertices of degree i, the degree splitting graph DS(G) is the graph obtained from G by adding new vertices wi for each Viwith |Vi | > 2, and joining wiwith every vertex in Vi . In this paper, we study the distance properties of degree splitting graphs. We classify the graphs into three families based on the variation of diameter of a graph from that of its degree splitting graph and obtain few results on them.

Authors and Affiliations

Selvam Avadayappan, M. Bhuvaneshwari, Rajeev Gandhi

Keywords

Related Articles

Synthesis, Characterisation And Water Permeability Of Mwnt Buckypapers

Significant work has been conducted to examine the synthesis and characterisation of MWNT buckypapers. Optimisation of the sonication time, electron microscopic investigation, contact angle analysis, electrical propertie...

An automated detection and classification approach in MRI tumor diagnosis

In the process of image coding, external noises impact a lot in processing efficiency. In the application of medical image processing, this effect is more, important due to its finer content details. It is required to mi...

EMW Distribution for Human Hormone

A stochastic modeling of biological systems is crucial to effectively and efficiently developing treatments for medical conditions that plague humanity. The study of challenge tests designed to evaluate serotoninergic pa...

FPGA Implementation of Key Exchange Algorithm

Due to rapid growth of Digital Communication, transmission of digital data plays a major role over in secured communication Channel. The main aim of this paper to establish Diffe Hellman key Exchange Algorithm which requ...

Assessment of surface and groundwater contamination by pesticides residues in a Sudano-Sahelian agricultural watershed (Korokoro, Mali)

Surface and groundwater contamination by pesticides (organochlorine, organophosphates and pyrethroids) was studied in the Korokoro watershed (60.6 km2 , Mali) where cotton and cereals (sorghum, maize etc.) are the main c...

Download PDF file
  • EP ID EP391841
  • DOI 10.9790/9622-0707061421.
  • Views 126
  • Downloads 0

How To Cite

Selvam Avadayappan, M. Bhuvaneshwari, Rajeev Gandhi (2017). Distance in Degree Splitting Graphs. International Journal of engineering Research and Applications, 7(7), 14-21. https://europub.co.uk./articles/-A-391841