Journals / Mathematical Sciences and Applications E-Notes / 2018 / Cilt: 6 - Sayı: 1

Strong Independent Saturation in Complementary Prisms

Pages
99–105
Publication Date
2022-10-19
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this paper, the strong independent saturation in complementaryprisms are considered, complementary prisms with small strong independent saturation numbers arecharacterized, and relationship between strong independent number and the distance-based parametersare investigated.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The strong independent saturation number Is(G) of a graph G = (V, E) is defined as min {Is(v) : v ∈ V },where Is(v) is the maximum cardinality of a minimal strong independent dominating set of G thatcontains v.
📊
Key Findings & Data:Let G¯ be the complement of a graph G .
💡
Conclusion & Impact:In this paper, the strong independent saturation in complementaryprisms are considered, complementary prisms with small strong independent saturation numbers arecharacterized, and relationship between strong independent number and the distance-based parametersare investigated.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

The strong independent saturation number Is(G) of a graph G = (V, E) is defined as min {Is(v) : v ∈ V },where Is(v) is the maximum cardinality of a minimal strong independent dominating set of G thatcontains v. Let G¯ be the complement of a graph G . The complementary prism GG¯ of G is the graphformed from the disjoint union of G and G¯ by adding the edges of a perfect matching between thecorresponding vertices of G and G¯. In this paper, the strong independent saturation in complementaryprisms are considered, complementary prisms with small strong independent saturation numbers arecharacterized, and relationship between strong independent number and the distance-based parametersare investigated.

🔖

Cite This Article

BERBERLER, Z. N. (2022). Strong Independent Saturation in Complementary Prisms. Mathematical Sciences and Applications E-Notes, Cilt: 6 - Sayı: 1, 99–105. https://ajindex.com/articles/578867

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (10)

  1. Berberler, Z.N. and Berberler, M.E., Independence saturation in complementary product types of graphs, CBU J. of Sci., 13 (2017), no. 2, 325-331
  2. Bomze, I., Budinich, M., Pardalos, P. and Pelillo, M.,“The maximum clique problem,” in Du, D. and Pardalos, P. (eds), Handbook of Combinatorial Optimization, Supplement Volume A, Kluwer Academic Press, 1999
  3. Bondy, J. A. and Murty, U. S. R., Graph theory with applications, American Elsevier Publishing Co., Inc., New York, 1976
  4. Buckley, F. and Harary, F., Distance in Graphs, Addison-Wesley Publishing Company Advanced Book Program, Redwood City, CA, 1990
  5. Chartrand, G. and Lesniak, L., Graphs and Digraphs:, Fourth Edition, Chapman and Hall, London, 2005
  6. Haynes, T. W., Henning, M. A., Slater, P. J. and Van Der Merwe, L. C., The complementary product of two graphs, Bull. Instit. Combin. Appl., 51 (2007), 21-30
  7. Korshunov, A. D., Coefficient of internal stability of graphs, Cybernetics, 10(1974), no. 1, 19-33
  8. Meena, N., Subramanian, A. and Swaminathan, V., Strong efficient domination and strong independent saturation number of graphs, International Journal of Mathematics and Soft Computing, 3 (2013), no. 2, 41-48
  9. Sampathkumar, E. and Pushpa Latha, L., Strong weak domination and domination balance in a graph, Discrete Math., 161 (1996), 235-242
  10. West, D. B., Introduction to Graph Theory, Prentice Hall, NJ, 2001.