Leilei Zhang

activity

20212026

most citedProof of a conjecture on hamiltonian-connected graphs

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

collaborators

Showing 2022Show all

4 papers · 1 filter

math.CO2022

Graphs with many independent vertex cuts

Yanan Hu, Xingzhi Zhan, Leilei Zhang

The cycles are the only $2$ -connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k \geq 3$ there exist…

math.CO2022

The minimum Kirchhoff index of phenylene chains

Leilei Zhang

Let $G$ be a connected graph. The resistance distance between any two vertices of $G$ is equal to the effective resistance between them in the corresponding electrical network cons…

math.CO2022

A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter

Leilei Zhang

In 1968, Ore determined the maximum size of $k$ -connected graphs with given order and diameter. In this note, we give a new short proof.

math.CO2022

The maximum number of $K_{r_{1}, \dots, r_{s}}$ in graphs with a given circumference or matching number

Leilei Zhang

Let $K_{r_{1}, \dots, r_{s}}$ denote the complete multipartite graph with class sizes $r_{1}, \dots, r_{s}$ and let $K_{s}$ denote the complete graph of order $s$ . In 2018, Luo determined the…

Graphs with many independent vertex cuts

The minimum Kirchhoff index of phenylene chains

A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter

The maximum number of Kr1​,…,rs​​ in graphs with a given circumference or matching number

The maximum number of $K_{r_{1}, \dots, r_{s}}$ in graphs with a given circumference or matching number