Güncel Gönderiler: Işık Üniversitesi Yayınları
Toplam kayıt 1285, listelenen: 801-820
-
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 ... -
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 ... -
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 ... -
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)) ... -
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) ... -
Integral inequalities via log m-convex functions
(Işık University Press, 2020)In this paper, we introduce and investigate a new concept of log m-convex functions. We establish some new Hermite-Hadamard type integral inequalities via log m-convex functions. Our results represent refinement and ... -
Starlike symmetrical functions
(Işık University Press, 2020)The objective of the present paper is to study subclass S ? ?? ?? (A, B) of analytic functions that is defined by using the class of Janowski functions combined with the (j, k)-symmetrical functions. This class generalizes ... -
Estimation of the location and scale parameters of moyal distribution
(Işık University Press, 2020)In this study, we estimate the parameters of the Moyal distribution by using well-known and widely-used maximum likelihood (ML) and method of moments (MoM) methodologies. The ML estimators of the location and scale parameters ... -
An integral equation involving Saigo-Maeda operator
(Işık University Press, 2020)The aim of this paper is to obtain a solution of integral equation of the Saigo- Maeda operator which contain Appell-hypergeometric function as a kernel. The integral equation and its solution gives new form of generalised ... -
Generalized fixed point results with multi-valued mappings
(Işık University Press, 2020)In this article we deduce fixed point results for multi-valued contraction mappings. We primarily established two fixed results. One of them is the generalization of Nadler’s contraction and the other result is the ... -
Fuzzy parameterized fuzzy soft matrices and their application in decision-making
(Işık University Press, 2020)In this study, we define the concept of fuzzy parameterized fuzzy soft matrices (fpfs-matrices) and present some of their basic properties. By using fpfs-matrices, we then suggest a new algorithm, i.e. Prevalence Effect ... -
On zagreb indices of double vertex graphs
(Işık University Press, 2020)Let G = (V, E) be a graph with at least 2 vertices, then the double vertex graph U?(G) is the graph whose vertex set consists of all 2-subsets of V such that two distinct vertices {x, y} and {u, v} are adjacent if and only ...
