Search
Now showing items 1-10 of 28
Key distribution using graphs for secret sharing
(Işık University Press, 2021)
Key distribution for secret sharing is the core important aspect of any secure cryptosystem, the threshold scheme enables a secret key to be shared among p members in which each member holds a part of the secret key. In ...
A note on indices of primepower and semiprime divisor function graph
(Işık University Press, 2021)
The notion of using number theortic based graph seems to be one of the flourishing areas in Graph theory. One such concept is the divisor function graph GD(n) which is defined as: For any positive integer n ≥ 1 with r ...
Results on majority dom-chromatic sets of a graph
(Işık University Press, 2021)
A majority dominating set S ⊆ V (G) is said to be majority dominating chromatic set if S satisfies the condition χ(hSi) = χ(G). The majority dom-chromatic number γMχ(G) is the minimum cardinality of majority dominating ...
Diametral paths in extended transformation graphs
(Işık University Press, 2021)
In a graph, diametral path is shortest path between two vertices which has length equal to diameter of the graph. Number of diametral paths plays an important role in computer science and civil engineering. In this paper, ...
Total vertex irregularity strength of interval graphs
(Işık University Press, 2021)
A labeling of a graph is a mapping that maps some set of graph elements to a set of numbers (usually positive integers). For a simple graph G = (V, E) with vertex set V and edge set E, a labeling φ : V ∪E → {1, 2, ..., k} ...
Triple connected eternal domination in graphs
(Işık University Press, 2021)
The concept of Triple connected domination number was introduced by G. Mahadevan et. al., in [10]. The concept of eternal domination in graphs was introduced by W. Goddard., et. al., in [3]. The dominating set S0(⊆ V (G)) ...
Stronger reconstruction of distance-hereditary graphs
(Işık University Press, 2021)
A graph is said to be set-reconstructible if it is uniquely determined up to isomorphism from the set S of its non-isomorphic one-vertex deleted unlabeled subgraphs. Harary’s conjecture asserts that every finite simple ...
Fuzzy zero divisor graph in a commutative ring
(Işık University Press, 2021)
Let R be a commutative ring and let Γ(Zn) be the zero divisor graph of a commutative ring R, whose vertices are non-zero zero divisors of Zn, and such that the two vertices u, v are adjacent if n divides uv. In this paper, ...
Connected majority domination vertex critical graphs
(Işık University Press, 2021)
In this article, how the removal of a single vertex from a graph G can change the Connected Majority Domination number is surveyed for any graph G. A graph is Connected Domination Critical if the removal of any vertex ...
A hybrid combination of substitution and transposition ciphers for efficient encryption using graph labeling
(Işık University Press, 2021)
In this study, we conceptualise a hybrid approach of plaintext encryption by making use of Substitution and Transposition cipher technique namely Playfair Cipher and Simple Columnar Transposition. Both the Ciphers are ...