Research Article
Article:Forcing Independent Spectrum in Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 21 - Issue 2 |
| Published: May 2011 |
| Authors: A.P.Pushpalatha, G.Jothilakshmi, S.Suganthi, V.Swaminathan |
10.5120/2487-3355
|
A.P.Pushpalatha, G.Jothilakshmi, S.Suganthi, V.Swaminathan . Article:Forcing Independent Spectrum in Graphs. International Journal of Computer Applications. 21, 2 (May 2011), 1-6. DOI=10.5120/2487-3355
@article{ 10.5120/2487-3355,
author = { A.P.Pushpalatha,G.Jothilakshmi,S.Suganthi,V.Swaminathan },
title = { Article:Forcing Independent Spectrum in Graphs },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 21 },
number = { 2 },
pages = { 1-6 },
doi = { 10.5120/2487-3355 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A A.P.Pushpalatha
%A G.Jothilakshmi
%A S.Suganthi
%A V.Swaminathan
%T Article:Forcing Independent Spectrum in Graphs%T
%J International Journal of Computer Applications
%V 21
%N 2
%P 1-6
%R 10.5120/2487-3355
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Let G = (V, E) be a simple graph. Let S be a maximum independent set of G. A subset T of S is called a forcing subset if T is contained in no other maximum independent subset in G. The independent forcing number of S denoted by fI(G, S) is the cardinality of a minimum forcing subset of S. The independent forcing number of G is the minimum of the independent forcing number of S, where S is a maximum independent subset in G. The independent forcing spectrum of G denoted by SpecI(G) is defined as the set SpecI(G) = {k : there exists a maximum independent set S of G such that fI(G, S) = k}. In this paper, a study of SpecI(G) is made..
References
- P. Afshania, H. Hatamia and E.S. Mahmoodian, On the spectrum of the forced matching number of graphs, Australas. J. Combin. 30(2004), 147.
- Gary Chartrand, Heather Gavlas and Robert C.Vandell, The Forcing domination number of a graph , JCMCC 25 (1997), 161-174.
- Terasa W. Haynes, Stephen T. Hedetneimi, Peter J. Slater,” Fundamentals of Domination in Graphs”, Marcel Dekker Inc. (1998).
- P.Adams, M.Mahdian and E.S. Mahmoodian, On the forced matching member of graphs, preprint”.
- G.Chartrand and P.Zhang, The forcing geodetic number of a graph”.Dicsuss. math. graph theory,19(1999),pp:45-58.
- M.E.Riddle, The minimum forcing number for the forus and hyper cube, preprint.
- T.W.Heynes, S.T.Hedetneimi, P.J.Slater, Domination in graphs, Advanced topics, Marcel Dekker., Inc.,(1998).
- T.W.Heynes, S.T.Hedetneimi, P.J.Slater, Fundamentals of Domination in graphs, Marcel Dekker., Inc.,(1998).
- F.Harray, Graph theory, Addition Wesley, Reading Mass (1972).
Index Terms
Keywords