14 citations · 14 across the 10 of their papers we have counts for
7 papers · 1 filter
On Neutral Edge Sets in Anti-Ramsey Numbers
Ali Ghalavand, Qing Jie, Zemin Jin +2
The anti-Ramsey number of a graph , introduced by Erdős et al.\ in 1975, is the maximum number of colors in an edge-coloring of the complete graph that avoids a rainbow co…
On the Anti-Ramsey Number Under Edge Deletion
Ali Ghalavand, Qing Jie, Zemin Jin +2
According to a study by Erdős et al. in 1975, the anti-Ramsey number of a graph \(G\), denoted as \(AR(n, G)\), is defined as the maximum number of colors that can be used in an ed…
Anti-Ramsey Numbers for Spanning Linear Forests of 3-Vertex Paths and Matchings
Ali Ghalavand, Xueliang Li
A subgraph in an edge-colored graph is called rainbow if all its edges have distinct colors. For a graph and an integer , the anti-Ramsey number is the maximum num…
Intertwining local (adjacency) metric dimension with the clique number of a graph
Ali Ghalavand, Sandi Klavžar, Xueliang Li
Let be a simple connected graph with order , local metric dimension , local adjacency metric dimension , and clique number ,…
On the local metric dimension of -free graphs
Ali Ghalavand, Xueliang Li
Let \( G \) be a graph with order \( n(G) \geq 5 \), local metric dimension \( \dim_l(G) \), and clique number \( ω(G) \). In this paper, we investigate the local metric dimension…
On the local metric dimension of -free graphs
Ali Ghalavand, Sandi Klavžar, Xueliang Li
Let be a graph of order , local metric dimension , and clique number . It has been conjectured that if , then $ \dim_l…
On Maximum Induced Forests of the Balanced Bipartite Graphs
Ali Ghalavand, Xueliang Li
The decycling number of a graph is the minimum number of vertices that must be removed to eliminate all cycles in . The forest number is the maximum numbe…