Now showing items 1-20 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 ﻿

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 ...
• #### 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 ...
• #### On total vertex irregularity strength of some classes of tadpole chain graphs ﻿

(Işık University Press, 2021)
A total k-labeling f that assigns V boolean OR E into {1,2, ...,k} on graph G is named vertex irregular if wt(f)(u) not equal wt(f)(v) for dissimilar vertices u, v in G with the weights wt(f) (u) = f(u) Sigma(ux is an ...
• #### The minimum mean monopoly energy of a graph ﻿

The motivation for the study of the graph energy comes from chemistry, where the research on the so-called total pi - electron energy can be traced back until the 1930s. This graph invariant is very closely connected to a ...
• #### Results on the inverse majority domination and majority independence number of a graph ﻿

(Işık University Press, 2021)
In this article,the relationship between Inverse Majority Domination number γ −1 M (G) and Majority Independence number βM(G) of a graph G is discussed for some classes of graphs. In particular, γ −1 M (G) and βM(G) for ...
• #### 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 ...
• #### Operations on totally weighted graphs ﻿

(Işık University Press, 2021)
The investigation and study of different operations on graphs leads many interesting results in various branches of science and technology. The operations of union, join, corona, Cartesian product and strong product in ...
• #### 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 ...
• #### Extension of m-polynomial and degree based topological indices for nanotube ﻿

(Işık University Press, 2021)
The M-polynomial of a graph G(V (G), E(G)) is defined as M(G; u, v) = Σ i≤j mijuⁱvʲ, where mij denotes the number of edges xy ∈ E(G) such that {dx, dy} = {i, j}, where dx, dy denote degree of the vertex x and y in the graph ...
• #### Neural network modeling of convection heat transfer coefficient for the casson nanofluid ﻿

(Işık University Press, 2021)
This paper presents applications of Artificial Neural Network (ANN) to develop a mathematical model of magnetohydrodynamic (MHD) flow and heat transfer in a Casson nanofluid. The model equations are solved numerically by ...
• #### Geodetic domination integrity in graphs ﻿

Reciprocal version of product degree distance of cactus graphs Let G be a simple graph. A subset S ⊆ V (G) is a said to be a geodetic set if every vertex u /∈ S lies on a shortest path between two vertices from S. The ...