Searcharxiv⌕ Search

arXiv subjects

Hong-Jian Lai

Publications and source records attributed to Hong-Jian Lai.

At least 19 recordsLinked to original sources

Upper bounds on all-terminal reliability polynomials in terms of cycle basis lengths

Let $G=(V(G),E(G))$ be a connected multigraph with $n$ vertices and $m$ edges. The all-terminal reliability polynomial of $G$ can be written as $R_G(q)=(1-q)^{n-1}\sum\limits_{i=0}^{d}H_iq^i$ where $d=m-n+1$ is the cycle rank, each edge fails independently with probability $q\in[0,1]$, and $H_0,\ldots,H_d$ are the associated coefficients. A cycle basis, which consists of cycles that form a basis of the cycle space of a graph, is an important tool for characterizing its cycle structure. The structural properties of cycle bases, together with the associated length optimization problems and construction algorithms, have been extensively studied. In this context, Colbourn posed the following open problem, which concerns upper bounds on the reliability coefficients in terms of cycle-basis lengths: For all-terminal reliability, is it true that if $G$ has a cycle basis containing cycles of lengths $c_1,\ldots,\allowbreak c_{m-n+1}$, then $H_i \le\sum\limits_{\substack{I\subseteq\{1,\ldots,m-n+1\},|I|=i}}\prod\limits_{j\in I}(c_j-1)$? In this paper, we establish a result that resolves this open problem.

math.CO↗

Orlik-Solomon algebras determine the Tutte polynomials of matroids of rank at most three

Let $\mathcal{M}$ be a simple matroid of rank $r$ on the ground set $[n]=\{1,\ldots,n\}$, let $T_{\mathcal{M}}(x,y)$ denote its Tutte polynomial, and let $\mathrm{OS}(\mathcal{M})$ denote its Orlik-Solomon $\mathbb{C}$-algebra. We say that $\mathrm{OS}(\mathcal{M})$ determines $T_{\mathcal{M}}(x,y)$ if, for every simple matroid $\mathcal{N}$, an isomorphism $\mathrm{OS}(\mathcal{M})\cong\mathrm{OS}(\mathcal{N})$ of $\mathbb{C}$-algebras, without regard to the grading, implies $T_{\mathcal{M}}(x,y)=T_{\mathcal{N}}(x,y)$. Falk conjectured that the Orlik-Solomon $\mathbb{C}$-algebra of every simple matroid of rank three determines its Tutte polynomial. We prove that this holds for every simple matroid of rank at most three, thereby resolving Falk's conjecture.

math.CO↗

Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity

Let $τ(G)$ denote the maximum number of pairwise edge-disjoint spanning trees contained in a graph $G$. Zhang and Fan [J. Graph Theory, 2026] posed the problem of determining the corresponding tight spectral-radius condition for every $s$-edge-connected graph with \[ k+1\leq s\leq2k-1, \] together with a characterization of the associated extremal graphs. In this paper, we completely resolve this problem.

math.CO↗

Sharp bounds and extremal structure of minimally strongly $k$-connected digraphs

Let $D$ be a finite simple minimally strongly $k$-connected digraph, where $k\ge 2$, and let $n=|V(D)|$. Mader proved in 1985 that $|A(D)|\le 2k(n-k)$ for all sufficiently large $n$, with equality if and only if $D\cong \overleftrightarrow{K}_{k,n-k}$ (JCTB 1985). We prove that this bound holds whenever $n\ge 3k-1$ and that the order threshold $3k-1$ is best possible. Moreover, if $n\ge 3k$, then equality holds if and only if $D\cong \overleftrightarrow{K}_{k,n-k}$. The threshold $3k$ is also best possible. These results resolve the conjecture of Mader in (JCTB 1985).

math.CO↗

On the local average order of dominating sets

The (global) average order of dominating sets of a graph is the average number of vertices of its dominating sets. Analogously, the local average order of dominating sets is the average number of vertices of its dominating sets containing a fixed vertex. In this paper, we show that the local average order of dominating sets of a graph with $n$ vertices is at least $\frac{n+1}{2}$, with equality if and only if the degree of the fixed vertex is $n-1$. Furthermore, for a graph on $n$ vertices without isolated vertices, we show that $\frac{5n-1}{6}$ is an upper bound for the local average order of dominating sets. Additionally, we give a proof of an exact formula for the local average order of dominating sets when the degree of the fixed vertex is $n-2$, and determine an upper bound for the local average order of dominating sets when the fixed vertex is an $l$-stem ($l \geq 2$).

math.CO↗

On the Tutte polynomial of series-parallel posets

The Tutte polynomial is a bivariate polynomial that has been extensively studied in graph and matroid theory. Gordon was the first to study the Tutte polynomial $T(P;x,y)$ of the greedoid induced by a poset $P$, including the special case of series-parallel posets. In particular, Gordon and McMahon conjectured that, for any two series-parallel posets $P$ and $Q$, the equality $T(P;x,y)=T(Q;x,y)$ holds if and only if $P\cong Q$. In studying this conjecture, Gordon introduced a subclass $\mathcal{P}$ of series-parallel posets and proved that this equivalence holds for all $P,Q\in\mathcal{P}$. In this paper, we introduce a new subclass $\mathrm H$ of series-parallel posets and prove that $\mathcal P\subseteq\mathrm H$. Moreover, we show that, for every $P\in\mathrm H$ and every $Q\in\mathrm{SP}$, the equality $T(P;x,y)=T(Q;x,y)$ holds if and only if $P\cong Q$, thereby extending Gordon's result.

math.CO↗

Optimal connectivity of second order iterated line graphs

The line graph $L(G)$ of a graph $G$ is defined to be the simple graph whose vertices are the edges of $G$, where two vertices in $L(G)$ are adjacent if and only if the corresponding edges in $G$ are incident with a common vertex, and define $L^2(G)=L(L(G))$. For positive integers $d$ and $k$, the function $κ_{L^2}(d,k) = \inf\{κ(L^2(G)): κ'(G) \ge k \mbox{ and } δ(G) \ge d\}$ has been investigated. Niepel and Knor proved that $κ_{L^2}(d,1)\geq d-1$, for any integer $d \ge 3$. In this research, it is proved that if $d\geq 3$ and $k\geq 1$, then $κ_{L^2}(d,k)= \min\{f(d,k), 4d-6\}$, where \begin{equation} f(d,k) = \left\{ \begin{array}{ll} k(d-k), & \mbox{ if $1\leq k\leq \lfloor\frac{d}{2}\rfloor$, } \\ kd-k^2+2k(\lceil \frac{d}{2}\rceil)-(\lceil\frac{d}{2}\rceil)d, & \mbox{ if $\lfloor\frac{d}{2}\rfloor< k <\frac{3d-1}{4}$, } \\ kd-k^2+2k\lfloor \frac{d}{2}\rfloor-2(\lfloor \frac{d}{2}\rfloor)^2, & \mbox{ if $\frac{3d-1}{4}\leq k<d$, }\\ d(\lceil \frac{d}{2}\rceil), & \mbox{ if } d=k. \end{array} \right.\nonumber \end{equation}

math.CO↗

On the Greedoid Tutte Polynomial for simple rooted graphs

The Tutte polynomial, through its rank-generating formula, provides a unified framework for describing various combinatorial structures of graphs and matroids, and serves as an important polynomial invariant connecting graph theory, matroid theory, and their related applications. Let $G=(V(G),E(G),r(G))$ be a simple rooted graph, where $V(G)$ is the vertex set, $E(G)$ is the edge set, and $r(G)$ is the root. Let $Γ(G)$ be the greedoid induced by the rooted graph $G$, and let its greedoid Tutte polynomial be denoted by $T(Γ(G);x,y)$. Let $r=r(G)$, $L_r(G)=\{v\in V(G)\setminus\{r\}: rv\in E(G),\ d_G(v)=1\}$, and $\ell_r(G)=|L_r(G)|$. Gordon and McMahon proposed the following conjecture: for rooted graphs, $\operatorname{ord}_{x}T(Γ(G);x,y)=\ell_r(G)$, where $\operatorname{ord}_{x}T(Γ(G);x,y)=\max\{a\in\mathbb Z_{\geq0}:x^a\mid T(Γ(G);x,y)\}$, that is, the highest power of $x$ dividing $T(Γ(G);x,y)$ is equal to the number of leaf vertices adjacent to the root. In this paper, we proved that this conjecture holds for all simple rooted graphs.

math.CO↗

Coefficients of univariate Tutte polynomials with one variable fixed

It is well known that the 2-variable Tutte polynomial of a graph $G$ includes chromatic polynomial and flow polynomial of $G$, i.e. the cases of $y=0$ and $x=0$. In 2013, Kálmán introduced the interior and exterior polynomials which generalized the cases of $y=1$ and $x=1$ of Tutte polynomials of graphs to hypergraphs, and further polymatroids. There have been some results on coefficients of these polynomials, which motivate us to study uniformly the coefficients of $T_M(x,t)$ and $T_M(t,y)$, where $T_M(x,y)$ denotes the Tutte polynomial of a matroid $M$ and $t$ is a fixed real number. In this paper, we introduce two mutually dual parameters $f_k(M)$ and $g_k(M)$ ($g_1(M)$ is the girth of $M$) for any nonnegative integer $k$, and obtain the following results: (1) Formulas for coefficients of the higher-degree terms (related to $g_2(M)$ and $f_2(M)$, respectively) of $T_M(x,t)$ and $T_M(t,y)$ in terms of circuits and hyperplanes of $M$; (2) when $0\leq t \leq 1$, coefficients of the more higher-degree terms (related to $g_1(M)$ and $f_1(M)$, respectively) of $T_M(x,t)$ and $T_M(t,y)$ are further simplified and characterized; (3) As applications, some known results in the cases $t=0$ and $t=1$ are derived and generalized, and the unimodality of these coefficients in (1) are proved when $t\leq 1$.

math.CO↗

On the characterizations of $\mathcal{D}_{k} \backslash \mathcal{D}_{k-2}$

The determinant of a tournament $T$, denoted by $\det(T)$, is defined as the determinant of the skew-adjacency matrix of $T$. It is well-known that $\det(T)$ is equal to $0$ if $n$ is odd, and $\det(T)$ is the square of an odd integer if $n$ is even. For a positive odd integer $k$, let $\mathcal{D}_k$ be the set of tournaments whose all subtournaments have determinant at most $k^2$. Former studies showed that for $k \in \{1,3,5\}$, a tournament $T \in \mathcal{D}_k \backslash \mathcal{D}_{k-2}$ ($T \in \mathcal{D}_1$ when $k=1$) if and only if $T$ is switching equivalent to a transitive blowup of $L_{k+1}$, where $L_{k+1}$ is a tournament of order $k+1$ with a specific structure. For $k \geq 7$, no characterization results are known. A natural problem is to characterize tournaments in $\mathcal{D}_{k} \backslash \mathcal{D}_{k-2}$ that can be switching equivalent to a transitive blowup of $L_{k+1}$ for $k \geq 7$. To address this problem and to further explore the structural properties of tournaments in $\mathcal{D}_{k}$, we introduce CR tournaments, strong CR tournaments, basic tournaments and $Z$-matrices, and investigate their properties. We use these properties to characterize those tournaments $T \in \mathcal{D}_{k} \backslash \mathcal{D}_{k-2}$ where $T$ contains a subtournament switching isomorphic to a basic strong CR tournament in $\mathcal{D}_{k} \backslash \mathcal{D}_{k-2}$. This result implies former characterizations of $\mathcal{D}_3\backslash \mathcal{D}_1$ and $\mathcal{D}_5 \backslash \mathcal{D}_3$. Using $Z$-matrices, we also show that for even $n$, $L_{n}$ is a basic strong CR tournament, and thus solve the open problem posed in [Discrete Math. 349 (2) (2026) 114766].

math.CO↗

Characterization of the structure of $k$-edge-maximal graphs

Let $κ^{\prime}(G)$ be the edge-connectivity of the graph $G$. The \textit{strength} of $G$, denoted by $\overlineκ^{\prime}(G)$, is the maximum edge-connectivity of its subgraphs. A simple graph $G$ is called $k$-\textit{edge-maximal} if $\overlineκ^{\prime}(G) \leq k$ but for any edge $e$ not in $G$, $\overlineκ^{\prime}(G+e) \geq k+1$. In this paper, we propose the concepts of kernel and closure of a graph and discuss the properties of closure. Utilizing these properties, we present the necessary and sufficient condition for a graph to be $k$-edge-maximal, which refines the results in [J. Graph Theory 14 (1990) 187--197], and prove that there exists a $k$-edge-maximal graph of order $n$ with $m$ edges if and only if $m=(n-1)k-\binom{k}{2}r$, for some integer $r$ with $1\leq r\leq \left\lfloor \frac{n}{k+2}\right\rfloor$. Furthermore, we characterize the structure of $k$-edge-maximal graphs with a given number of edges.

math.CO↗

Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs

The Hamiltonicity and related subjects of split graphs, and in particular $K_{1,r}$-free split graphs with $r\ge 3$ received much attention. Dai et al. [Discrete Math. 345 (2022) 112826] conjectured that every $(r-1)$-connected $K_{1,r}$-free split graph is Hamiltonian. They proved the case when $r=4$, and earlier Renjith and Sadagopan [Int. J. Found. Comput. Sci. 33 (2022) 1--32] proved the case when $r=3$. Recently, Liu, Song, Zhang and Lai [Discrete Math. 346 (2023) 113402] proved that a split graph is Hamiltonian if and only if it is fully cycle extendable. So for $r=3,4$ every $(r-1)$-connected $K_{1,r}$-free split graph is fully cycle extendable. We give tight spectral sufficient conditions for a $K_{1,r}$-free split graph to be Hamiltonian for $r=3,4$.

math.CO↗

Realizing degree sequences with $\mathcal S_3$-connected graphs

A graph $G$ is $\mathcal S_3$-connected if, for any mapping $β: V (G) \mapsto {\mathbb Z}_3$ with $\sum_{v\in V(G)} β(v)\equiv 0\pmod3$, there exists a strongly connected orientation $D$ satisfying $d^{+}_D(v)-d^{-}_D(v)\equiv β(v)\pmod{3}$ for any $v \in V(G)$. It is known that $\mathcal S_3$-connected graphs are contractible configurations for the property of flow index strictly less than three. In this paper, we provide a complete characterization of graphic sequences that have an $\mathcal{S}_{3}$-connected realization: A graphic sequence $π=(d_1,\, \ldots,\, d_n )$ has an $\mathcal S_3$-connected realization if and only if $\min \{d_1,\, \ldots,\, d_n\} \ge 4$ and $\sum^n_{i=1}d_i \ge 6n - 4$. Consequently, every graphic sequence $π=(d_1,\, \ldots,\, d_n )$ with $\min \{d_1,\, \ldots,\, d_n\} \ge 6$ has a realization $G$ with flow index strictly less than three. This supports a conjecture of Li, Thomassen, Wu and Zhang [European J. Combin., 70 (2018) 164-177] that every $6$-edge-connected graph has flow index strictly less than three.

math.CO↗

Improved bounds for the coefficient of flow polynomials

Let $G$ be a connected bridgeless $(n,m)$-graph which may have loops and multiedges, and let $F(G,t)$ denote the flow polynomial of $G$. Dong and Koh \cite{Dong1} established an upper bound for the absolute value of coefficient $c_{i}$ of $t^{i}$ in the expansion of $F(G,t)$, where $0\leqslant i \leqslant m-n+1$. In this paper, we refine the aforementioned bound. Specifically, we demonstrate that when $n \leqslant m \leqslant n+3$, $|c_{i}|\leqslant d_{i}$, where $d_{i}$ is the coefficient of $t^{i}$ in the expansion $\prod\limits_{j=1}^{m-n+1}(t+j)$; and when $m\geqslant n+4$, $|c_{i}|\leqslant d_{i}$, with $d_{i}$ being the coefficient of $t^{i}$ in the expansion $(t+1)(t+2)(t+3)^{2}(t+4)^{m-n-3}$. Furthermore, we prove that if $G$ is a connected bridgeless cubic graph having only real flow roots, then $b_{i}\leqslant |c_{i}|$, where $b_{i}$ is the coefficient of $t^{i}$ in the expansion $(t+1)(t+2)^{\frac{n}{2}}$. Notably, if $G$ is simple connected bridgeless cubic graph with only real flow roots, then $b_{i}$ is the coefficient of $t^{i}$ in the expansion $(t+1)(t+2)^{\frac{n}{2}-2}(t+3)^{2}$.

math.CO↗

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

Let $M=(m_{ij})$ be an $n\times n$ matrix. The second immanant of matrix $M$ is defined by \begin{eqnarray*} d_{2}(M)=\sum_{σ\in S_{n}}χ_{2}(σ)\prod_{s=1}^{n}m_{sσ(s)}, \end{eqnarray*} where $χ_{2}$ is the irreducible character of $S_{n}$ corresponding to the partition $(2^{1},1^{n-2})$. The polynomial $d_{2}(xI-M)$ is called the second immanantal polynomial of matrix $M$. Denote by $D(G)$ (resp. $D(\overrightarrow{G})$) and $A(G)$ (resp. $A(\overrightarrow{G})$) the diagonal matrix of vertex degrees and the adjacency matrix of undirected graph $G$ (resp. digraph $\overrightarrow{G}$), respectively. In this article, we prove that $d_{2}(xI-A(G))$ (resp. $d_{2}(xI-A(\overrightarrow{G}))$) can be reconstructed from the second immanantal polynomials of the adjacency matrix of all subgraphs in $\{G-uv,G-u-v|uv\in E(G)\}$ (resp. $\{\overrightarrow{G}-e|e\in E(\overrightarrow{G})\}$). Furthermore, the polynomial $d_{2}(xI-D(\overrightarrow{G})\pm A(\overrightarrow{G}))$ can also be reconstructed by the second immanantal polynomials of the (signless) Laplacian matrixs of all subgraphs in $\{\overrightarrow{G}-e|e\in E(\overrightarrow{G})\}$, respectively.

math.CO↗

Diameter two orientability of mixed graphs

In 1967, Katona and Szemerédi showed that no undirected graph with $n$ vertices and fewer than $\frac{n}{2}\log_2\frac{n}{2}$ edges admits an orientation of diameter two. In 1978, Chvátal and Thomassen revealed the complexity of determining whether an undirected graph can be oriented to achieve a diameter of two, proving it to be NP-complete. This breakthrough has sparked ongoing interest in identifying sufficient conditions for graphs to be oriented with the smallest possible diameter of two -- critical for optimizing communication and network flow in larger structures. In 2019, Czabarka, Dankelmann, and Székely significantly advanced this field by establishing that the minimum degree threshold for achieving such an orientation in undirected graphs of order $n$ is $\frac{n}{2} + Θ(\ln n)$. In this paper, we extend this foundational result by determining the minimum degree threshold necessary for realizing an orientation with diameter two in mixed graphs, which contain both undirected and directed edges. Mixed graphs offer a versatile framework, representing an intermediate stage in the orientation process, making our findings a substantial generalization of previous results.

math.CO↗

Square Coloring of Planar Graphs with Maximum Degree at Most Five

The \textit{square} of a graph $G$, denoted by $G^2$, is obtained from $G$ by adding an edge to connect every pair of vertices with a common neighbor in $G$. In this paper we prove that for every planar graph $G$ with maximum degree at most $5$, $G^2$ admits a proper vertex coloring using at most $17$ colors, which improves the upper bound $18$ recently obtained by Hou, Jin, Miao, and Zhao.

math.CO↗

No mixed graph with the nullity $η(\widetilde{G})=|V(G)|-2m(G)+2c(G)-1$

A mixed graph $\widetilde{G}$ is obtained from a simple undirected graph $G$, the underlying graph of $\widetilde{G}$, by orienting some edges of $G$. Let $c(G)=|E(G)|-|V(G)|+ω(G)$ be the cyclomatic number of $G$ with $ω(G)$ the number of connected components of $G$, $m(G)$ be the matching number of $G$, and $η(\widetilde{G})$ be the nullity of $\widetilde{G}$. Chen et al. (2018)\cite{LSC} and Tian et al. (2018)\cite{TFL} proved independently that $|V(G)|-2m(G)-2c(G) \leq η(\widetilde{G}) \leq |V(G)|-2m(G)+2c(G)$, respectively, and they characterized the mixed graphs with nullity attaining the upper bound and the lower bound. In this paper, we prove that there is no mixed graph with nullity $η(\widetilde{G})=|V(G)|-2m(G)+2c(G)-1$. Moreover, for fixed $c(G)$, there are infinitely many connected mixed graphs with nullity $|V(G)|-2m(G)+2c(G)-s$ $( 0 \leq s \leq 3c(G), s\neq1 )$ is proved.

math.CO↗