A. Zafari

activity

20182026

most citedFrequency Disentangled Features in Neural Image Compression

11 citations · 31 across the 15 of their papers we have counts for

collaborators

Showing math.COShow all

9 papers · 1 filter

math.CO2026

On the Spectrum of the Line Graph of a Family of Bipartite Graphs Arising from the Boolean Lattice

Ali Zafari, Saeid Alikhani

The Boolean lattice $B L_{n}$ , $n \geq 3$ , is the graph whose vertex set is the collection of all subsets of $[n] = {1, 2, \dots, n}$ , where two subsets $U$ and $W$ are adjacent if and o…

math.CO2026

The partition dimension and $k$ -domination number of a family of non-distance regular graph

Ali Zafari, Saeid Alikhani

A partition $Σ = {S_{1}, S_{2}, \dots, S_{k}}$ of the vertex set $V (G)$ is a resolving partition if every pair of distinct vertices in $G$ has a unique representation relative to $Σ$ . T…

math.CO2025

Some results on Hamming graphs and an extended Hamming graphs

Ali Zafari, Saeid Alikhani

In this paper we first obtain the spectrum of the folded hypercube in a new approach. Then we introduce a new family of graphs called the extended Hamming graph, denoted by $EH(n,2…

math.CO2021

Metric dimension, doubly resolving set and strong metric dimension for $(C_{n} □ P_{k}) □ P_{m}$

Jia-Bao Liu, Ali Zafari

A subset $Q = {q_{1}, q_{2}, ..., q_{l}}$ of vertices of a connected graph $G$ is a doubly resolving set of $G$ if for any various vertices $x, y \in V (G)$ we have $r(x|Q)-r(y|Q)\neqλI…

math.CO2021

Some resolving parameters with the minimum size for two specific graphs

Ali Zafari, Saeid Alikhani

A resolving set for a graph $G$ is a set of vertices $Q = {q_{1}, ..., q_{k}}$ such that, for all $p \in V (G)$ the $k$ -tuple $(d (p, q_{1}), ..., d (p, q_{k}))$ uniquely determines $p$ , wh…

math.CO2020

Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of Layer Sun Graph

Jia-Bao Liu, Ali Zafari

Let $G$ be a finite, connected graph of order of at least 2, with vertex set $V (G)$ and edge set $E (G)$ . A set $S$ of vertices of the graph $G$ is a doubly resolving set for $G$ i…

math.CO2019

Some resolving parameters in a class of Cayley graphs

Jia-Bao Liu, Ali Zafari

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a…

math.CO2019

On the spectrum of two families of non-distance-regular graphs

Ali Zafari, Saeid Alikhani

This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods b…

math.CO2019

Some algebraic properties of a class of integral graphs determined by their spectrum

Jia-Bao Liu, S. Morteza Mirafzal, Ali Zafari

Let $Γ = (V, E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $Γ$ are integers, then we say that $Γ$ is an integral graph. A graph $Γ$ is determined by its…

On the Spectrum of the Line Graph of a Family of Bipartite Graphs Arising from the Boolean Lattice

The partition dimension and k-domination number of a family of non-distance regular graph

Some results on Hamming graphs and an extended Hamming graphs

Metric dimension, doubly resolving set and strong metric dimension for (Cn​□Pk​)□Pm​

Some resolving parameters with the minimum size for two specific graphs

Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of Layer Sun Graph

Some resolving parameters in a class of Cayley graphs

On the spectrum of two families of non-distance-regular graphs

Some algebraic properties of a class of integral graphs determined by their spectrum

The partition dimension and $k$ -domination number of a family of non-distance regular graph

Metric dimension, doubly resolving set and strong metric dimension for $(C_{n} □ P_{k}) □ P_{m}$