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 Set-Graphs

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

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 118 - Number 7
Year of Publication: 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 },
issue_date = { May 2015 },
volume = { 118 },
number = { 7 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume118/number7/20754-3173/ },
doi = { 10.5120/20754-3173 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:01:00.684846+05:30
%A Johan Kok
%A K. P. Chithra
%A N. K. Sudev
%A C. Susanth
%T A Study On Set-Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 118
%N 7
%P 1-5
%D 2015
%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
  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan Press, London, 1976.
  2. G. Chartrand and L. Lesniak, Graphs and Digraphs, CRC Press, 2000.
  3. J. T. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, 2006.
  4. 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.
  5. F. Harary, Graph Theory, Addison-Wesley, 1994.
  6. 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.
  7. 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.
  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. D. B. West, Introduction to Graph Theory, Pearson Education Inc. , 2001.
Index Terms

Computer Science
Information Sciences

Keywords

set-graphs primitive hole primitive degree.

Powered by PhDFocusTM