Research Article
A Study On Set-Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 118 - Issue 7 |
| Published: May 2015 |
| Authors: Johan Kok, K. P. Chithra, N. K. Sudev, C. Susanth |
10.5120/20754-3173
|
Johan Kok, K. P. Chithra, N. K. Sudev, C. Susanth . A Study On Set-Graphs. International Journal of Computer Applications. 118, 7 (May 2015), 1-5. DOI=10.5120/20754-3173
@article{ 10.5120/20754-3173,
author = { Johan Kok,K. P. Chithra,N. K. Sudev,C. Susanth },
title = { A Study On Set-Graphs },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 118 },
number = { 7 },
pages = { 1-5 },
doi = { 10.5120/20754-3173 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A Johan Kok
%A K. P. Chithra
%A N. K. Sudev
%A C. Susanth
%T A Study On Set-Graphs%T
%J International Journal of Computer Applications
%V 118
%N 7
%P 1-5
%R 10.5120/20754-3173
%I Foundation of Computer Science (FCS), NY, USA
Abstract
A primitive hole of a graph G is a cycle of length 3 in G. The number of primitive holes in a given graph G is called the primitive hole number of that graph G. The primitive degree of a vertex v of a given graph G is the number of primitive holes incident on the vertex v. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number of a set-graph and the primitive degree of its vertices. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to subsets of equal cardinality, the number of largest complete subgraphs in a set-graph etc. are discussed in this study. A recursive formula to determine the primitive hole number of a set-graph is also derived in this paper.
References
- J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan Press, London, 1976.
- G. Chartrand and L. Lesniak, Graphs and Digraphs, CRC Press, 2000.
- J. T. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, 2006.
- S. S. Gupta and T. Liang, On a Sequential Subset Selection Procedure, Technical report #88-23, Department of Statistics, Purdue University, Indiana, U. S. , 1988.
- F. Harary, Graph Theory, Addison-Wesley, 1994.
- J. Kok and N. K. Sudev, A Study on Primitive Holes of Certain Graphs, International Journal of Scientific and Engineering Research, 6(3)(2015), 631-635.
- J. Kok and Susanth C. , Introduction to the McPherson Number (G) of a Simple Connected Graph, Pioneer Journal of Mathematics and Mathematical Sciences, 13(2), (2015), 91- 102.
- T. A. McKee and F. R. McMorris, Topics in Intersection Graph Theory, SIAM, Philadelphia, 1999.
- K. H. Rosen, Handbook of Discrete and Combinatorial Mathematics, CRC Press, 2000.
- D. B. West, Introduction to Graph Theory, Pearson Education Inc. , 2001.
Index Terms
Keywords