Characterization the Deletable Set of Vertices in the (p-3)--Regular Graphs
-
2128
Downloads
-
3391
Views
Authors
Akram B. Attar
- Department of Mathematics,University of Thi-Qar, College of Education, Iraq
Abstract
In this paper we characterized the ( p - 3 )- regular graphs which have a
3−deletable and a 4−deletable set of vertices.
Share and Cite
ISRP Style
Akram B. Attar, Characterization the Deletable Set of Vertices in the (p-3)--Regular Graphs, Journal of Mathematics and Computer Science, 3 (2011), no. 2, 156--164
AMA Style
Attar Akram B., Characterization the Deletable Set of Vertices in the (p-3)--Regular Graphs. J Math Comput SCI-JM. (2011); 3(2):156--164
Chicago/Turabian Style
Attar, Akram B.. "Characterization the Deletable Set of Vertices in the (p-3)--Regular Graphs." Journal of Mathematics and Computer Science, 3, no. 2 (2011): 156--164
Keywords
- reducibility
- regular graphs
- dominating set
- and dominating number.
MSC
References
-
[1]
B. Attar Akram, B. N. Waphare, Reducibility of Eulerian Graphs and Digraphs, Journal of Al-Qadisiyah for Pure Science, 13 (2008), 183--194
-
[2]
G. Bordalo, B. Monjardet, Reducible classes of finite lattices, Order , 13 (1996), 379--390
-
[3]
J. Clark, D. A. Holton, A First Look at Graph Theory, World Scientific, London (1991)
-
[4]
F. Harary , Graph Theory, Addison-Wesley, Reading (1969)
-
[5]
V. S. Kharat, B. N. Waphare, Reducibility in finite posets, Europ. J. Combinatorics, 22 (2001), 197--205
-
[6]
P. J. Slater, Locating dominating sets and locating-dominating sets, In: Graph Theory, Combinatorics and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, 2 (1995), 1073--1079
-
[7]
W. T. Tutte, Graph Theory, Addison-Wesley, Reading (1984)
-
[8]
D. B. West, Introduction to Graph Theory, Prentice Hall, Upper Saddle River (1999)
-
[9]
L. W. Beineke, R. J. Wilson, Selected Topics in Graph Theory, Academic Press, London (1978)
