INDEPENDENTLY SATURATED GRAPHS

Volume: 8 Number: 1 June 1, 2018
  • Z.n. Berberler
  • M.e. Berberler
TWMS Journal of Applied and Engineering Mathematics Cover
TWMS Journal of Applied and Engineering Mathematics
PDF Download
EN

INDEPENDENTLY SATURATED GRAPHS

Abstract

The independence saturation number IS G of a graph G = V;E is de ned as minfIS V : v 2 V g , where IS v is the maximum cardinality of an independent set that contains v. In this paper, we consider and compute exact formulae for the independence saturation in speci c graph families and composite graphs.

Keywords

References

  1. Korshunov, A. D.,(1974), Coefficient of internal stability of graphs, Cybernetics 10 (1) pp. 19-33.
  2. West, D.B., (2001), Introduction to Graph Theory, Prentice Hall, NJ.
  3. Bomze, I., Budinich, M., Pardalos, P., Pelillo, M., (1999), The maximum clique problem, in D. Du and P. Pardalos (eds), Handbook of Combinatorial Optimization, Supplement Volume A, Kluwer Academic Press.
  4. Subramanian, M., (2004), Studies in Graph Theory-Independence saturation in Graphs, Ph.D thesis, Manonmaniam Sundaranar University.
  5. Arumugam, S., Subramanian, M., (2007), Independence saturation and extended domination chain in graphs, AKCE J. Graphs. Combin. 4(2) pp. 5969.
  6. Muthulakshmi, T., Subramanian, M., (2014), Independence saturation number of some classes of graphs, Far East Journal of Mathematical Sciences 86(1) pp. 11-21.

Details

Primary Language

English

Subjects

-

Journal Section

-

Authors

Z.n. Berberler This is me

M.e. Berberler This is me

Publication Date

June 1, 2018

Submission Date

-

Acceptance Date

-

Published in Issue

Year 2018 Volume: 8 Number: 1

IZ

https://izlik.org/JA72PS42XC

Cite

RIS / Bibtex
APA
Berberler, Z., & Berberler, M. (2018). INDEPENDENTLY SATURATED GRAPHS. TWMS Journal of Applied and Engineering Mathematics, 8(1), 44-50. https://izlik.org/JA72PS42XC
AMA
1.Berberler Z, Berberler M. INDEPENDENTLY SATURATED GRAPHS. JAEM. 2018;8(1):44-50. https://izlik.org/JA72PS42XC
Chicago
Berberler, Z.n., and M.e. Berberler. 2018. “INDEPENDENTLY SATURATED GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 8 (1): 44-50. https://izlik.org/JA72PS42XC.
EndNote
Berberler Z, Berberler M (June 1, 2018) INDEPENDENTLY SATURATED GRAPHS. TWMS Journal of Applied and Engineering Mathematics 8 1 44–50.
IEEE
[1]Z. Berberler and M. Berberler, “INDEPENDENTLY SATURATED GRAPHS”, JAEM, vol. 8, no. 1, pp. 44–50, June 2018, [Online]. Available: https://izlik.org/JA72PS42XC
ISNAD
Berberler, Z.n. - Berberler, M.e. “INDEPENDENTLY SATURATED GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 8/1 (June 1, 2018): 44-50. https://izlik.org/JA72PS42XC.
JAMA
1.Berberler Z, Berberler M. INDEPENDENTLY SATURATED GRAPHS. JAEM. 2018;8:44–50.
MLA
Berberler, Z.n., and M.e. Berberler. “INDEPENDENTLY SATURATED GRAPHS”. TWMS Journal of Applied and Engineering Mathematics, vol. 8, no. 1, June 2018, pp. 44-50, https://izlik.org/JA72PS42XC.
Vancouver
1.Z.n. Berberler, M.e. Berberler. INDEPENDENTLY SATURATED GRAPHS. JAEM [Internet]. 2018 Jun. 1;8(1):44-50. Available from: https://izlik.org/JA72PS42XC