Strong Independent Saturation in Complementary Prisms

@inproceedings{Berberler2018StrongIS,
  title={Strong Independent Saturation in Complementary Prisms},
  author={Zeynep Nihan Berberler},
  year={2018}
}
The strong independent saturation number I(G) of a graph G = (V,E) is defined as min {I(v) : v ∈ V }, where I(v) is the maximum cardinality of a minimal strong independent dominating set of G that contains v. Let Ḡ be the complement of a graph G . The complementary prism ḠG of G is the graph formed from the disjoint union of G and Ḡ by adding the edges of a perfect matching between the corresponding vertices of G and Ḡ. In this paper, the strong independent saturation in complementary prisms… Expand
Independent strong domination in complementary prisms
TLDR
The independent strong domination in complementary prisms is considered, the complementary pr prism GĠ of G is the graph formed from the disjoint union of G and Ġ by adding the edges of a perfect matching between the corresponding vertices of G, and the relationship betweenindependent strong domination number and the distance-based parameters is investigated. Expand

References

SHOWING 1-10 OF 14 REFERENCES
Independence Saturation In Complementary Product Types of Graphs
The independence saturation number of a graph is defined as , where is the maximum cardinality of an independent set that contains vertex . Let be the complement graph of . Complementary prisms areExpand
Strong weak domination and domination balance in a graph
TLDR
The strong (weak) domination number γs (γw) of G is the minimum cardinality of an sd-set (wd-set) and some bounds are obtained in the study of domination balanced graphs. Expand
Strong efficient domination and strong independent saturation number of graphs
A subset S of V(G) of a graph G is called a strong (weak) efficient dominating set of G if for every v V(G), │Ns[v]∩S│= 1 (│Nw[v]∩S│= 1 ) where Ns(v) = { u V(G) : uv E(G), deg(u) ≥Expand
Introduction to Graph Theory
1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs. 2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration.Expand
The maximum clique problem
TLDR
A survey of results concerning algorithms, complexity, and applications of the maximum clique problem is presented and enumerative and exact algorithms, heuristics, and a variety of other proposed methods are discussed. Expand
The complementary product of two graphs
  • Bull . Instit . Combin . Appl .
  • 2007
The complementary product of two graphs, Bull. Instit
  • Combin. Appl.,
  • 2007
Introduction to Graph
  • 2001
M.,“The maximum clique problem,
  • Handbook of Combinatorial Optimization, Supplement Volume A,
  • 1999
...
1
2
...