Güncel Gönderiler: JAEM 2021, Vol 11, Special Issue
Toplam kayıt 28, listelenen: 21-28
-
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, ... -
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 ... -
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 ... -
The orientation number of three complete graphs with linkages
(Işık University Press, 2021)For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is d~(G) = min{d(D)|D ? D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we consider the problem of ... -
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 ... -
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, ... -
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 ... -
Cyclic orthogonal double covers of 6-regular circulant graphs by disconnected forests
(Işık University Press, 2021)An orthogonal double cover (ODC) of a graph H is a collection G = {Gv : v ? V (H)} of |V (H)| subgraphs of H such that every edge of H is contained in exactly two members of G and for any two members Gu and Gv in G, |E(Gu) ...
