Ara
Toplam kayıt 10, listelenen: 1-10
Graphs with equal domination and independent domination number
(Işık University Press, 2015)
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the ...
On the average lower 2-domination number of a graph
(Işık University Press, 2019)
Computer scientists and network scientists want a speedy, reliable, and nonstop communication. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure ...
Annihilator domination number of tensor product of path graphs
(Işık University Press, 2019)
An annihilator dominating set (ADS) is a representative technique for finding the induced subgraph of a graph which can help to isolate the vertices. A dominating set of graph G is called ADS if its induced subgraph is ...
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 ...
Domination number of a bipartite semigraph when it is a cycle
(Işık University Press, 2022)
Semigraph is a generalization of graph, with two or more vertices on edges which allows multiplicity in every concept of graph when it comes to semigraph. When number of vertices on the edges are restricted to two the ...
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 ...
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 ...
Roman and inverse roman domination in network of triangles
(Işık University Press, 2023-04)
In graph G (V, E), a function f : V → {0, 1 2} is said to be a Roman Dominating Function (RDF). If ∀u ∈ V, f(u) = 0 is adjacent to at least one vertex v ∈ V such that f(v) = 2. The weight of f is given by w(f) = P v∈V f(v). ...
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 ...
Congruent dominating sets in a graph - a new concept
(Işık University Press, 2023-10)
A dominating set D ⊆ V (G) is said to be a congruent dominating set of G if Ʃv∈V (G) d(v) ≡ 0 ( mod Ʃv∈D d(v) ). The minimum cardinality of a minimal congruent dominating set of G is called the congruent domination number ...