Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ∪ E → {1, 2, …, k} such that for any two different edges xy and x’y’ in E, ω(xy) ≠ ω(x’y’) where ω(xy) = f(x) + f(y) + f(xy). The minimum k for which the graph G admits an edge irregular total k-labeling is called the total edge irregularity strength of G, denoted by tes(G). In this paper, we show the exact value of the total edge irregularity strength of any book graph of m sides and n sheets Bn(Cm) and of any double book graph of m sides and 2n sheets 2Bn(Cm).
Let be a simple undirected graph with finite vertex set and edge set . A total -labeling is called a total edge irregular labeling on if for any two different edges and in the numbers and are distinct. The smallest positive integer n such that can be labeled by a total edge irregular labeling is called the total edge irregularity strength of the graph . In this paper, we provide the total edge irregularity strength of some asymmetric graphs and some symmetric graphs, namely generalized arithmetic staircase graphs and generalized double-staircase graphs, as the generalized forms of some existing staircase graphs. Moreover, we give the construction of the corresponding total edge irregular labelings.
14 December 2023 in Malaysian Journal of Mathematical Sciences
The k-token graph of a given graph G, is the graph which vertex set consists of all k− subsets of the vertex set of G and two vertices are connected by an edge exactly when their difference corresponds to an edge of G. In this paper, we give a description on the structure of the 2-token graph of disjoint union of multiple graphs. This result complements the previous findings regarding the properties of the k-token graphs.
26 July 2023 in Journal of the Indonesian Mathematical Society
Let G be a finite group. Associate a simple undirected graph Γ_G with G, called bipartite graph associated to elements and cosets of subgroups of G, as follows : Take G ∪ S_G as the vertices of Γ_G, with S_G is the set of all subgroups of a group G and join two vertices a ∈ G and H ∈ S_G if and only if aH = Ha. In this paper, hamiltonicity and eulerianity of Γ_G for some finite groups G are studied. In particular, it is obtained that for any cyclic group G, Γ_G is hamiltonian if and only if |G| = 2 and Γ_G is eulerian if and only if |G| is even non-perfect square number. Also, we prove that Γ_Dn is eulerian if k is even and n = 2k and for some other cases of n, Γ_Dn is not eulerian.
6 February 2024 in Asian-European Journal of Mathematics
Given a simple connected undirected graph G and let k be the maximum number of its vertices and its edges. Let f be a bijective labeling from the set of its edges to the set of odd integers from 1 up to 2q − 1, where q is the number of edges of G. The labeling f is called an edge odd graceful labeling on G if the weights of any two different vertices are different, where the weight of a vertex v is defined as the sum mod(2k) of all labels of edges that are incident to v. A graph is called an edge odd graceful graph if it admits an edge odd graceful labeling. In this paper, we show that there are some new classes of graphs that are edge odd graceful.