CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A Study on Edge-Set Graphs of Certain Graphs

by Johan Kok, N.K. Sudev, K.P. Chithra
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 127 - Number 6
Year of Publication: 2015
Authors: Johan Kok, N.K. Sudev, K.P. Chithra
10.5120/ijca2015906385

Johan Kok, N.K. Sudev, K.P. Chithra . A Study on Edge-Set Graphs of Certain Graphs. International Journal of Computer Applications. 127, 6 ( October 2015), 1-5. DOI=10.5120/ijca2015906385

@article{ 10.5120/ijca2015906385,
author = { Johan Kok, N.K. Sudev, K.P. Chithra },
title = { A Study on Edge-Set Graphs of Certain Graphs },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 127 },
number = { 6 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume127/number6/22730-2015906385/ },
doi = { 10.5120/ijca2015906385 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:19:08.761117+05:30
%A Johan Kok
%A N.K. Sudev
%A K.P. Chithra
%T A Study on Edge-Set Graphs of Certain Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 127
%N 6
%P 1-5
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Let G(V,E) simple connected graph, with |E| = ε. In this paper, we define an edge-set graph GG constructed from the graph G such that any vertex Vs,i of GG corresponds to the i-th s-element subset of E(G) and any two vertices Vs,i , Vk,m of GG are adjacent if and only if there is at least one edge in the edge-subset corresponding to Vs,i which is adjacent to at least one edge in the edge-subset corresponding to Vk,m where s, k are positive integers. It can be noted that the edge-set graph GG of a graph G is dependent on both the structure of G as well as the number of edges ε.We also discuss the characteristics and properties of the edge-set graphs corresponding to certain standard graphs.

References
  1. S. Arumugam and S. Velammal, Edge Domination in Graphs, Taiwanese Journal of Mathematics, 2(2)(1998), 173-179.
  2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan Press, London, 1976.
  3. G. Chartrand and L. Lesniak, Graphs and Digraphs, CRC Press, 2000.
  4. J. T. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, 2006.
  5. F. Harary, Graph Theory, Addison-Wesley, 1994.
  6. J. Kok, K. P. Chithra, N. K. Sudev and C. Susanth, A Study on Set-Graphs, International Journal of Computer Applications, 118(7)(2015), 1-5., DOI: 10.5120/20754-3173.
  7. J Kratochvil, D. Zeps, On the Number of Hamilton cycles in Triangulations, Journal of Graph Theory, 12(2)(1988), 191- 194.
  8. T. A. McKee and F. R. McMorris, Topics in Intersection Graph Theory, SIAM, Philadelphia, 1999.
  9. K. H. Rosen, Handbook of Discrete and Combinatorial Mathematics, CRC Press, 2000.
  10. S. K. Vaidya and R. M. Pandit, Edge Domination in Some Path and Cycle Related Graphs, ISRN Discrete Mathematics, 2014 (2014), Article ID: 975812, 1-5., DOI: 10.1155/2014/975812.
  11. D. B. West, Introduction to Graph Theory, Pearson Education Inc., 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Edge-set graph Total edge-degree of a graph Edge-degree of vertex Connected edge dominating set Artificial edge-set element

Powered by PhDFocusTM