Distance in Degree Splitting Graphs
Journal Title: International Journal of engineering Research and Applications - Year 2017, Vol 7, Issue 7
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
- EP ID EP391841
- DOI 10.9790/9622-0707061421.
- Views 118
- Downloads 0
Enhancement of Power Quality by Contemporary Power Electronic Transformer
This paper presents a new type of power electronic transformer. In the design process, the AC/DC, DC/AC, AC/AC converters and high frequency transformer have been used. One matrix converter operates as AC/AC converter in...
Alarm System Implementation on Field Programmable Gate Array
In recent times, Field Programmable Gate Arrays have wide applications in market due to its advantage of having programmable interconnects. Alarm-system is the best solution to overcome house intrusion. The effective Ala...
Enigma of Coal as Source Rock
.
Real Time Image Fusion using Multi Resolution Discrete Sine Transform
Image fusion is a process, used to fuse two or more images into one image without any loss of data, images are taken from different sensors in different Field Of View (FOV). In recent days, image fusion is playing an imp...
A Novel Approach to Analyze Satellite Images for Severe Weather Events
Severe weather events (e.g. cyclones, thunderstorms, fog, floods etc.) have catastrophic effects on human life and aggrandize the impacts on agriculture, economy etc. Therefore information related to severe weather, in a...