Jixiang Meng

collaborators

5 papers

math.CO2024

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

Changchang Dong, Mei Lu, Jixiang Meng +1

Given a graph $T$ and a family of graphs $F$ , the maximum number of copies of $T$ in an $F$ -free graph on $n$ vertices is called the generalized Turán number, d…

math.CO2024

Essential connectivity and spectral radius of graphs

Wenxiu Ding, Dan Li, Yu Wang +1

A graph is trivial if it contains one vertex and no edges. The essential connectivity $κ^{'}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal produ…

math.CO2024

Antidirected hamiltonian paths in $k$ -hypertournaments

Hong Yang, Changchang Dong, Jixiang Meng +1

A $k$ -hypertournament $H$ on $n$ vertices is a pair $(V (H), A (H))$ , where $V (H)$ is a set of vertices and $A (H)$ is a set of $k$ -tuples of vertices, called arcs, such that for any $…

math.CO2024

A new condition on dominated pair degree sum for a digraph to be supereulerian

Changchang Dong, Jixiang Meng, Juan Liu

A digraph $D$ is supereulerian if $D$ contains a spanning eulerian subdigraph. For any two vertices $u, v$ in a digraph $D$ , if $(u, w), (v, w) \in A (D)$ for some $w \in V (D)$ , then we c…

math.CO2024

Sufficient conditions for closed-trailable in digraphs

Changchang Dong, Hong Yang, Jixiang Meng +1

A digraph $D$ with a subset $S$ of $V (D)$ is called $S$ {\bf -strong} if for every pair of distinct vertices $u$ and $v$ of $S$ , there is a $(u, v)$ -dipath and a $(v, u…

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

Essential connectivity and spectral radius of graphs

Antidirected hamiltonian paths in k-hypertournaments

A new condition on dominated pair degree sum for a digraph to be supereulerian

Sufficient conditions for closed-trailable in digraphs

Antidirected hamiltonian paths in $k$ -hypertournaments