Construction of Sc Chordal and Sc Weakly Chordal Graphs
American Journal of Applied Mathematics
Volume 4, Issue 3, June 2016, Pages: 163-168
Received: Apr. 13, 2016; Accepted: May 18, 2016; Published: Jun. 4, 2016
Views 3568      Downloads 201
Authors
Parvez Ali, College of Engineering, Unayzah, Qassim University, Al-Qassim, Kingdom of Saudi Arabia
Syed Ajaz Kareem Kirmani, College of Engineering, Unayzah, Qassim University, Al-Qassim, Kingdom of Saudi Arabia
Article Tools
Follow on us
Abstract
Study of any graph class includes characterization, recognition, counting the number of graphs i.e. cataloging and construction of graphs. The construction of sc chordal graphs by mean of complementing permutation is one of the known method. In this paper, a new method for the construction of sc chordal graphs is proposed based on a two-pair of graphs. We also presented algorithm for the construction of sc weakly chordal graphs.
Keywords
Self-Complementary Graph, Chordal and Weakly Chordal Graph, Two-Pair, Degree Sequence, P4
To cite this article
Parvez Ali, Syed Ajaz Kareem Kirmani, Construction of Sc Chordal and Sc Weakly Chordal Graphs, American Journal of Applied Mathematics. Vol. 4, No. 3, 2016, pp. 163-168. doi: 10.11648/j.ajam.20160403.17
Copyright
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
References
[1]
A. Berry, A. Sigayret and C. Sinoquet, Maximal sub-triangulation as pre-processing phylogentic data, Soft computing 10 (2006) 461-468.
[2]
C. T. Hoang, Brain Moore, D. Roecoskie, J Sawada, M. Vatshelle, Construction of k- critical P5-free graphs, Discrete Applied Mathematics, 182 (2015), 91-98.
[3]
D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacafic J. Math., 15 (1965) 835-855.
[4]
G. Ringel, Selbstkomplementare Graphen, Arch Math. (Basel), 14 (1963) 354-358.
[5]
H. Sachs, Uber selbstkomplementare Graphen, Publ. Math. Debreen, 9 (1962) 270-288.
[6]
J. Yellen and J Gross, Graph Theory and its Applications, CRC Press (USA), 1999.
[7]
J. Xu and C. K. Wong, Self-complementary graphs and Ramsey numbers Part-1: the decomposition and the construction of self-complementary graphs, Discrete mathematics, 223 (2000) 309-326.
[8]
Lihuan Mao, Fenjin Liu, Wei Wang, A new method for the constructing graphs determined by their generalized spectrum, Linear Algebra and its Applications, 477 (2015) 112-127.
[9]
M. R. Sridharan and K. Balaji, Characterisation of self-complementary chordal graphs, Discrete Mathematics, 188 (1998) 279-283.
[10]
M. R. Sridharan and K. Balaji, On construction of self-complementary chordal graphs, Journal of Combinatorics Information and system sciences, 24 (1999) 39-45.
[11]
R. A. Gibbs, Self-Complementary Graphs, J. Comb. Theory Series B, 16 (1974) 106-123.
[12]
R. B. Hayward, Generating weakly triangulated graphs, J. Graph Theory, 21 (1996) 67-70.
[13]
Xueyi Huang and Qiongxiang Huang Construction of graphs with exactly k main eigenvalues, Linear Algebra and its Applications, 486 (2015), 204-218
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186