Konu "Critical graph" için listeleme
Toplam kayıt 5, listelenen: 1-5
-
Chromatic weak domatic partition in graphs
(Işık University Press, 2019)In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum ... -
Parallel critical graphs
(Işık University Press, 2023-04)Let G1 and G2 be two undirected graphs. Let u1, v1 ∈ V ( G1 ) and u2, v2 ∈ V ( G2 ). A parallel composition forms a new graph H that combines G1 and G2 by contracting the vertices u1 with u2 and v1 with v2. A new kind of ... -
Tight just excellent graphs
(Işık University Press, 2019)A graph G is χ-excellent if for every vertex v, there exists a chromatic partition π such that {v} ∈ π.A graph G is just χ-excellent if every vertex appears as a singleton in exactly one χ-partition. In this paper, a special ... -
Total colorings of core-satellite, cocktail party and modular product graphs
(Işık University Press, 2020)A total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is an assignment of colors to the elements of the graph G such that no two adjacent elements (vertices and edges) receive a ... -
Zero forcing and power domination for lexicographic product of two fuzzy soft graphs
(Işık University Press, 2020)Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In both cases, the goal is to eventually observe ...