Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Korivand, Meysam
Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran
Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Edge-locating coloring of graphs Korivand, Meysam; Mojdeh, Doost Ali; Baskoro, Edy Tri; Erfanian, Ahmad
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2024.12.1.6

Abstract

An edge-locating coloring of a simple connected graph G is a partition of its edge set into matchings such that the vertices of G are distinguished by the distance to the matchings. The minimum number of the matchings of G that admits an edge-locating coloring is the edge-locating chromatic number of G, and denoted by χ′L(G). This paper introduces and studies the concept of edge-locating coloring. Graphs G with χ′L(G)∈{2, m} are characterized, where m is the size of G. We investigate the relationship between order, diameter and edge-locating chromatic number. We obtain the exact values of χ′L(Kn) and χ′L(Kn − M), where M is a maximum matching; indeed this result is also extended for any graph. We determine the edge-locating chromatic number of the join graphs of some well-known graphs. In particular, for any graph G, we show a relationship between χ′L(G + K1) and Δ(G). We investigate the edge-locating chromatic number of trees and present a characterization bound for any tree in terms of maximum degree, number of leaves, and the support vertices of trees. Finally, we prove that any edge-locating coloring of a graph is an edge distinguishing coloring.
Uniquely proper distinguishing colorable graphs Korivand, Meysam; Soltankhah, Nasrin; Khashyarmanesh, Kazem
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.2.15

Abstract

A proper vertex-coloring of a graph G is called distinguishing, if the only automorphism preserving the colors is the identity. The minimum number of colors for such a coloring is denoted by χD(G). We say a graph G is uniquely proper distinguishing colorable (UPDC, for short) if and only if there exists only one partition of V(G) into χD(G) independent sets such that the identity is the only automorphism of G preserving the partition.In this paper, we study the UPDC graphs. We show that a disconnected graph is UPDC if and only if it is the union of two isomorphic asymmetric connected bipartite graphs. We prove some results on bipartite UPDC graphs and show that any UPDC tree is one of the following: (i) an asymmetric tree, (ii) a tree with precisely one non-trivial automorphism and center xy such that this automorphism interchanges x and y, (iii) a star graph. Additional, a characterization of all graphs G of order n with the property that χD(G∪G) = χD(G) = k, where k=n-2, n-1, n, is given in this paper. Finally, we determine all graphs G of order n with the property that χD(G∪G) = χD(G)+1 = ℓ, where ℓ=n-1, n, n+1.
Co-Authors Edy Tri Baskoro Erfanian, Ahmad Khashyarmanesh, Kazem Mojdeh, Doost Ali Soltankhah, Nasrin