Graceful labeling of a graph with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex. In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph , graph, graph, jellyfish graph , Dragon graph , kite graph ( and the double comb graph ,
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.
The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by . A local resolving function of is a real valued function such that for and . The local fractional metric dimension of graph denoted by , defined by In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph and graph , where graph is a connected graphs and graph is a complate graph &
... Show MoreLet be a prime ring, be a non-zero ideal of and be automorphism on. A mapping is called a multiplicative (generalized) reverse derivation if where is any map (not necessarily additive). In this paper, we proved the commutativity of a prime ring R admitting a multiplicative (generalized) reverse derivation satisfying any one of the properties:
for all x, y
The main objective of this paper is to find the order and its exponent, the general form of all conjugacy classes, Artin characters table and Artin exponent for the group of lower unitriangular matrices L(3,? p ), where p is prime number.
The purpose of this paper is to study a new class of fuzzy covering dimension functions, called fuzzy
In this article, the partially ordered relation is constructed in geodesic spaces by betweeness property, A monotone sequence is generated in the domain of monotone inward mapping, a monotone inward contraction mapping is a monotone Caristi inward mapping is proved, the general fixed points for such mapping is discussed and A mutlivalued version of these results is also introduced.
In this present paper, we obtain some differential subordination and superordination results, by using generalized operators for certain subclass of analytic functions in the open unit disk. Also, we derive some sandwich results.
In this paper, we give new results and proofs that include the notion of norm attainment set of bounded linear operators on a smooth Banach spaces and using these results to characterize a bounded linear operators on smooth Banach spaces that preserve of approximate - -orthogonality. Noting that this work takes brief sidetrack in terms of approximate - -orthogonality relations characterizations of a smooth Banach spaces.
In this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.
A total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class. The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.