Ara
Toplam kayıt 28, listelenen: 21-28
Reciprocal version of product degree distance of cactus graphs
(Işık University Press, 2021)
The reciprocal version of product degree distance is a product degree weighted version of Harary index defined for a connected graph G as RDD*(G) = Sigma({x, y}subset of V(G) )(d(G)(x).d(G)(y))/d(G)(x,y), where d(G)(x) is ...
Bounds on hyper-status connectivity index of graphs
(Işık University Press, 2021)
In this paper, we obtain the bounds for the hyper-status connectivity indices of a connected graph and its complement in terms of other graph invariants. In addition, the hyper-status connectivity indices of some composite ...
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 ...
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
(Işık University Press, 2021)
A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ...
Algorithmic complexity of isolate secure domination in graphs
(Işık University Press, 2021)
A dominating set S is an Isolate Dominating Set (IDS) if the induced subgraph G[S] has at least one isolated vertex. In this paper, we initiate the study of new domination parameter called, isolate secure domination. An ...
Vertex coloring edge weightings of some square graphs
(Işık University Press, 2021)
A k-edge-weighting w of a graph G is an assignment of integer weight, w(e) ? {1, 2, . . . , k}, to each edge e. A k-edge-weighting w induces a vertex coloring c by defining c(u) = P u?e w(e) for every u ? V (G), where u ? ...
Edge-vertex domination and total edge domination in trees
(Işık University Press, 2021)
An edge e is an element of E(G) dominates a vertex v is an element of V (G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such ...
I-Cordial labeling of spider graphs
(Işık University Press, 2021)
Let G= (V, E) be a graph with p vertices and q edges. A graph G=(V,E)with p vertices and q edges is said to be an I-cordial labeling of a graph if there exists an injective map f from V to left perpendicular-p/2..p/2right ...