CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Article:Forcing Independent Spectrum in Graphs

by A.P.Pushpalatha, G.Jothilakshmi, S.Suganthi, V.Swaminathan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 21 - Number 2
Year of Publication: 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 },
issue_date = { May 2011 },
volume = { 21 },
number = { 2 },
month = { May },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume21/number2/2487-3355/ },
doi = { 10.5120/2487-3355 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:07:26.710232+05:30
%A A.P.Pushpalatha
%A G.Jothilakshmi
%A S.Suganthi
%A V.Swaminathan
%T Article:Forcing Independent Spectrum in Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 21
%N 2
%P 1-6
%D 2011
%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
  1. P. Afshania, H. Hatamia and E.S. Mahmoodian, On the spectrum of the forced matching number of graphs, Australas. J. Combin. 30(2004), 147.
  2. Gary Chartrand, Heather Gavlas and Robert C.Vandell, The Forcing domination number of a graph , JCMCC 25 (1997), 161-174.
  3. Terasa W. Haynes, Stephen T. Hedetneimi, Peter J. Slater,” Fundamentals of Domination in Graphs”, Marcel Dekker Inc. (1998).
  4. P.Adams, M.Mahdian and E.S. Mahmoodian, On the forced matching member of graphs, preprint”.
  5. G.Chartrand and P.Zhang, The forcing geodetic number of a graph”.Dicsuss. math. graph theory,19(1999),pp:45-58.
  6. M.E.Riddle, The minimum forcing number for the forus and hyper cube, preprint.
  7. T.W.Heynes, S.T.Hedetneimi, P.J.Slater, Domination in graphs, Advanced topics, Marcel Dekker., Inc.,(1998).
  8. T.W.Heynes, S.T.Hedetneimi, P.J.Slater, Fundamentals of Domination in graphs, Marcel Dekker., Inc.,(1998).
  9. F.Harray, Graph theory, Addition Wesley, Reading Mass (1972).
Index Terms

Computer Science
Information Sciences

Keywords

Forcing domination number of a graph Forcing spectrum of a graph Forcing independent spectrum of a graph.

Powered by PhDFocusTM