相关论文: Spectral conditions of complement for some graphic…

Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…

Let $G$ be a connected graph. If $G$ contains a matching of size $k$, and every matching of size $k$ is contained in a perfect matching of $G$, then $G$ is said to be \emph{$k$-extendable}. A $k$-regular spanning subgraph of $G$ is called a…

An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum…

Let $\mathcal{G}_{n, \beta^*}$ $(\mathcal{G}^*_{n,\beta^*})$ be the set of all (connected) graphs of order $n$ with fractional matching number $\beta^*$. In this paper, the graphs with maximal spectral radius in $\mathcal{G}_{n,\beta^*}$…

A graph $G$ is called fractional $[a,b]$-covered if for every edge $e$ of $G$ there is a fractional $[a,b]$-factor with the indicator function $h$ such that $h(e)=1$. In this paper, we provide tight spectral radius conditions for graphs…

We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of K\"uhn and…

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

A fractional $(a,b,m)$-covered graph is a generalization of the concept of a fractional $[a,b]$-covered graph. For any $H \subseteq G$ with edge set $|E(H)| = m$, if there exists a fractional $[a,b]$-factor (the corresponding fractional…

The investigation of eigenvalue conditions for the existence of an $[a,b]$-factor originates in the work of Brouwer and Haemers (2005) on perfect matchings. In the decades since, spectral extremal problems related to $[a,b]$-factors have…

Let $G$ be a connected graph of order $n$. A $\{P_3,P_4,P_5\}$-factor is a spanning subgraph $H$ of $G$ such that every component of $H$ is isomorphic to an element of $\{P_3,P_4,P_5\}$. In this paper, we establish a sufficient condition on…

In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of…

We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.

For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian if the removal of any $k\le s$ vertices results in a Hamiltonian graph. Given a connected simple graph $G$ that is not isomorphic to a path, a cycle, or a $K_{1,3}$,…

We say a graph $G$ has a Hamiltonian path if it has a path containing all vertices of $G$. For a graph $G$, let $\sigma_2(G)$ denote the minimum degree sum of two nonadjacent vertices of $G$; restrictions on $\sigma_2(G)$ are known as…

We study optimal minimum degree conditions when an $n$-vertex graph $G$ contains an $r$-regular $r$-connected subgraph. We prove for $r$ fixed and $n$ large the condition to be $\delta(G) \ge \frac{n+r-2}{2}$ when $nr \equiv 0 \pmod 2$.…

A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…

A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than $2$. In this paper, we give a sufficient condition which can make Hermitian spectral…

A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every $S\subseteq G$ with $|S|=k$. A connected graph $G$ is called $t$-connected if it has more than $t$ vertices and remains connected whenever fewer than $t$…

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…