Search
Now showing items 1-10 of 28
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 ...
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 ...
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 ...
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, ...
The minimum mean monopoly energy of a graph
(Işık University Press, 2021)
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 ...
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} ...
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 ...
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)) ...
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 ...
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 ...