Gang Ma

activity

20142024

most citedOn

{1, 2}

-distance-balancedness of generalized Petersen graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2024

On $ℓ$ -distance-balancedness of cubic Cayley graphs of dihedral groups

Gang Ma, Jianfeng Wang, Guang Li +1

A connected graph $Γ$ of diameter $diam (Γ) \geq ℓ$ is $ℓ$ -distance-balanced if $∣ W_{x y} (Γ) ∣ = ∣ W_{y x} (Γ) ∣$ for every $x, y \in V (Γ)$ with $d_{Γ} (x, y) = ℓ$ , where $W_{x y} (Γ)$ …

math.CO2024★ 1 cited

On ${1, 2}$ -distance-balancedness of generalized Petersen graphs

Gang Ma, Jianfeng Wang, Sandi Klavžar

A connected graph $G$ of diameter $diam (G) \geq ℓ$ is $ℓ$ -distance-balanced if $∣ W_{x y} ∣ = ∣ W_{y x} ∣$ for every $x, y \in V (G)$ with $d_{G} (x, y) = ℓ$ , where $W_{x y}$ is the…

math.CO2023

Non- $ℓ$ -distance-balanced generalized Petersen graphs $GP (n, 3)$ and $GP (n, 4)$

Gang Ma, Jianfeng Wang, Sandi Klavžar

math.CO2022

On distance-balanced generalized Petersen graphs

Gang Ma, Jianfeng Wang, Sandi Klavžar

math.CO2014

The matching energy of graphs with given edge connectivity

Shengjin Ji, Hongping Ma

Let G be a simple graph of order $n$ and $μ_{1}, μ_{2}, \dots, μ_{n}$ the roots of its matching polynomial. The matching energy of $G$ is defined as the sum $\sum_{i = 1}^{n} ∣ μ_{i} ∣$ . Let $K_{n-…

On ℓ-distance-balancedness of cubic Cayley graphs of dihedral groups

On {1,2}-distance-balancedness of generalized Petersen graphs

Non-ℓ-distance-balanced generalized Petersen graphs GP(n,3) and GP(n,4)

On distance-balanced generalized Petersen graphs

The matching energy of graphs with given edge connectivity

On $ℓ$ -distance-balancedness of cubic Cayley graphs of dihedral groups

On ${1, 2}$ -distance-balancedness of generalized Petersen graphs

Non- $ℓ$ -distance-balanced generalized Petersen graphs $GP (n, 3)$ and $GP (n, 4)$