相关论文: The $\alpha$-normal labeling method for computing …

It is well known that the spectral radius of a tree whose maximum degree is $D$ cannot exceed $2\sqrt{D-1}$. In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the…

For a graph $G$, the generalized adjacency matrix $A_\alpha(G)$ is the convex combination of the diagonal matrix $D(G)$ and the adjacency matrix $A(G)$ and is defined as $A_\alpha(G)=\alpha D(G)+(1-\alpha) A(G)$ for $0\leq \alpha \leq 1$.…

We examine a special case of an approximation of the joint spectral radius given by Blondel and Nesterov, which we call the outer spectral radius. The outer spectral radius is given by the square root of the ordinary spectral radius of the…

We study certain combinatorial aspects of list-decoding, motivated by the exponential gap between the known upper bound (of $O(1/\gamma)$) and lower bound (of $\Omega_p(\log (1/\gamma))$) for the list-size needed to decode up to radius $p$…

In the DAG Edge Deletion problem, we are given an edge-weighted directed acyclic graph and a parameter $k$, and the goal is to delete the minimum weight set of edges so that the resulting graph has no paths of length $k$. This problem,…

In this work we study the wavefront set of a solution u to Pu = f, where P is a pseudodifferential operator on a manifold with real-valued homogeneous principal symbol p, when the Hamilton vector field corresponding to p is radial on a…

The binding number $b(G)$ of a graph, introduced by Woodall [J. Combin. Theory, Ser. B, 1973], is a central topic of both structural and extremal graph theory. It is closely related to fundamental combinatorial and structural properties of…

For a set of graphs $\mathcal{F}$, let $\ex(n,\mathcal{F})$ and $\spex(n,\mathcal{F})$ denote the maximum number of edges and the maximum spectral radius of an $n$-vertex $\mathcal{F}$-free graph, respectively. Nikiforov ({\em LAA}, 2007)…

We study the extremal problem that relates the spectral radius $\lambda (G)$ of an $F$-free graph $G$ with its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $\chi (F)=r+1\ge 3$, if $G$ is an $F$-free graph…

This paper deals with the $\lambda$-labeling and $L(2,1)$-coloring of simple graphs. A $\lambda$-labeling of a graph $G$ is any labeling of the vertices of $G$ with different labels such that any two adjacent vertices receive labels which…

By a graph we mean a finite undirected graph having multiple edges but no loops. Given a graph property $\mathcal{P}$, a $\mathcal{P}$-coloring of a graph $G$ with color set $C$ is a mapping $\f:V(G)\to C$ such that for each color $c\in C$…

We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…

Fix a positive integer $n$, a real number $p\in (0,1]$, and a (perhaps random) hypergraph $\mathcal{H}$ on $[n]$. We introduce and investigate the following random multigraph model, which we denote $\mathbb{G}(n,p\, ; \,\mathcal{H})$: begin…

A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors…

In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected…

Let $\mathcal{H}^{(r)}_n$ be the set of all connected $r$-graphs with given size $n$. In this paper, we investigate the effect on the spectral radius of $r$-uniform hypergraphs by grafting or contracting an edge and then give the ordering…

Let $\mathcal{U}(n,k)$ and $\Gamma(n,k)$ be the set of the $k$-uniform linear and nonlinear unicyclic hypergraphs having perfect matchings with $n$ vertices respectively, where $n\geq k(k-1)$ and $k\geq 3$. By using some techniques of…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of $G(n,p)$. Let the \emph{maximum density} of a graph $H$ be the maximum average degree of all the subgraphs of $H$. First,…

In tensor eigenvalue problems, one is likely to be more interested in H-eigenvalues of tensors. The largest H-eigenvalue of a nonnegative tensor or of a uniform hypergraph is the spectral radius of the tensor or of the uniform hypergraph.…