Searcharxiv⌕ Search

arXiv subjects

Pingshan Li

Publications and source records attributed to Pingshan Li.

10 recordsLinked to original sources

Characterization of Cubic Graphs with Exactly Two Lonely Edges

Perfect matchings are fundamental to understanding structural connectivity in cubic graphs, with "lonely edges" (edges in exactly one perfect matching) forming a critical underexplored class. Goedgebeur et al. (J. Graph Theory, 112 (2026) 276-289) established an upper bound of 6 on the number of lonely edges in 3-connected non-double covered cubic graphs and completely characterized the classes $\mathcal{U}_k$ for $3 \le k \le 6$. Narayana et al. subsequently gave a recursive characterization of the subclass in which the two lonely edges lie in the same perfect matching. This paper completes the classification by presenting a full structural characterization of $\mathcal{U}_2$, the family of 3-connected cubic graphs with exactly two lonely edges. We identify the minimally non-contractible "primitive kernels" of $\mathcal{U}_2$ and develop constructive operations to generate any graph in $\mathcal{U}_2$ from these kernels.

math.CO↗

On the Kőnig-Egerváry theorem for $k$-trees

The famous Kőnig-Egerváry theorem is equivalent to the statement that a graph is bipartite if and only if the matching number equals the vertex cover number for every induced subgraph. Bessy, Ochem, and Rautenbach (J. Graph Theory 91 (2019) 73-87) generalized this theorem to $k$-paths by introducing the class $\mathcal{G}_k$ of graphs where, for every induced subgraph, the maximum number of disjoint paths of order $k$ equals the minimum number of vertices intersecting all such paths. They provided complete structural characterizations of graphs in $\mathcal{G}_k$ for $k \in \{3, 4\}$, and for odd $k$ when no cycle of order less than $k$ is present. Inspired by this nice work, we extend the Kőnig-Egerváry theorem to $k$-trees (i.e., trees with exactly $k$ vertices). We define the class $\mathcal{J}_k$ of graphs where, for every induced subgraph, the maximum number of disjoint trees of order $k$ equals the minimum number of vertices intersecting all such trees, and provide complete structural descriptions of graphs in $\mathcal{J}_k$ for all $k \ge 3$.

math.CO↗

A characterization of graphs attaining a lower bound on the dissociation number

The dissociation number ${\rm diss}(G)$ of a graph $G$ is defined as the maximum cardinality of a vertex subset $D\subseteq V(G)$ such that the induced subgraph $G[D]$ has maximum degree at most $1$. In 2023, Bock, Pardey, Penso and Rautenbach [J. Graph Theory 103 (2023), 661--673] showed that ${\rm diss}(G)\ge n-\frac{1}{3}(m+k+c_1)$ where $n, m, k, c_1$ denote the numbers of vertices, edges, components and induced cycles of length $1$ modulo $3$ in $G$ and they also established a complete characterization of extremal graphs under the vertex-disjoint cycle constraint. Although this partial characterization offers very valuable structural insights, it excludes many simple extremal graphs. So they posed a natural question: How can all extremal graphs be comprehensively characterized without restrictions? In this paper, we give a recursive characterization of all graphs attaining equality in this bound.

math.CO↗

The cyclic diagnosability of Cayley graphs generated by transposition triangle-free unicyclic graphs under the PMC and MM* models

Diagnosability is a critical parameter for evaluating the reliability and self-diagnostic capacity of multiprocessor systems. As an advanced extension of traditional diagnosability, cyclic diagnosability has been proposed to enable more comprehensive assessment of the diagnostic capabilities of interconnection networks. In this paper, we prove that under both the PMC and MM* models, the cyclic diagnosability of Cayley graphs generated by triangle-free unicyclic graphs is 5n-10 for n\ge11.

math.CO↗

A note on the second-largest number of dissociation sets in connected graphs

A subset of vertices is called a dissociation set if it induces a subgraph with vertex degree at most one. Recently, Yuan et al. established the upper bound of the maximum number of dissociation sets among all connected graphs of order n and characterized the corresponding extremal graphs.They also proposed a question regarding the second-largest number of dissociation sets among all connected graphs of order n and the corresponding extremal graphs. In this paper, we give a positive answer to this question.

math.CO↗

A classification of two-distance-transitive Cayley graphs over the generalized quaternion groups

A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps $(u_1,v_1)$ to $(u_2,v_2)$. This is a generalization concept of the classical well-known distance-transitive graphs. In this paper, we completely determine the family of $2$-distance-transitive Cayley graphs over the generalized quaternion groups.

math.CO↗

Component Edge Connectivity of Hypercube-like Networks

As a generalization of the traditional connectivity, the g-component edge connectivity cλg(G) of a non-complete graph G is the minimum number of edges to be deleted from the graph G such that the resulting graph has at least g components. Hypercube-like networks (HL-networks for short) are obtained by manipulating some pairs of edges in hypercubes, which contain several famous interconnection networks such as twisted cubes, Mobius cubes, crossed cubes, locally twisted cubes. In this paper, we determine the (g + 1)-component edge connectivity of the n-dimensional HL-networks.

math.CO↗

Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. R.X. Hao et al. $(2014)$ \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adjacent vertices in $BH_n$ with $(2n-2)$ faulty edges. D.Q. Cheng et al. $(2015)$ \cite{Dongqincheng2} proved that $BH_n$ is $6$-edge-bipancyclic after $(2n-3)$ faulty edges occur for all $n\ge2$. In this paper, we improve these two results by demonstrating that $BH_n$ is $6$-edge-bipancyclic even when there exist $(2n-2)$ faulty edges for all $n\ge2$. Our result is optimal with respect to the maximum number of tolerated edge faults.

math.CO↗

Fault-free Hamiltonian cycles in balanced hypercube with conditional edge faults

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. Zhou et al. [Inform. Sci. 300 (2015) 20-27] proposed an interesting problem that whether there is a fault-free Hamiltonian cycle in $BH_n$ with each vertex incident to at least two fault-free edges. In this paper, we consider this problem and show that each fault-free edge lies on a fault-free Hamiltonian cycle in $BH_n$ after no more than $4n-5$ faulty edges occur if each vertex is incident with at least two fault-free edges for all $n\ge 2$. Our result is optimal with respect to the maximum number of tolerated edge faults.

math.CO↗

The super spanning connectivity of arrangement graph

A $k$-container $C(u, v)$ of a graph $G$ is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u, v)$ of $G$ is a $k^*$-container if it is a spanning subgraph of $G$. A graph $G$ is $k^*$-connected if there exists a $k^*$-container between any two different vertices of G. A $k$-regular graph $G$ is super spanning connected if $G$ is $i^*$-container for all $1\le i\le k$. In this paper, we prove that the arrangement graph $A_{n, k}$ is super spanning connected if $n\ge 4$ and $n-k\ge 2$.

math.CO↗