相关论文: On the first and second eigenvalue of finite and i…

We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.

A chain of quantum subgroups of the quantum automorphism group of finite graphs has been introduced. It generalizes the construction of J. Bichon (see [3]) in a sense. A better bound of the non zero eigenvalues of the graph Laplacian has…

We give an upper bound on the list chromatic number of a 2-colorable hypergraph which generalizes the bound of Schauz on $k$-partite $k$-uniform hypergraphs. It makes sense for sparse hypergraphs: in particular we show that a $k$-uniform…

Klavik et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition…

A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

A graph $\Gamma$ is said to be universal for a class of graphs $\mathcal{H}$ if $\Gamma$ contains a copy of every $H \in \mathcal{H}$ as a subgraph. The number of edges required for a host graph $\Gamma$ to be universal for the class of…

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

For a $k$-uniform hypergraph $F$ we consider the parameter $\Theta(F)$, the minimum size of a clique cover of the of $F$. We derive bounds on $\Theta(F)$ for $F$ belonging to various classes of hypergraphs.

Antonio Ros gave a lower bound for the first eigenvalue $\lambda_1$ of $\Delta$ of a $P$-manifold $(M, g)$ in terms of the lower bound on the Ricci curvature $Ric_M$ and asked what happened when this lower bound was achieved. In this paper…

In this work limit probabilities of first-order properties of the random $s$-uniform hypergraph in the binomial model $G^{s}(n,p)$ are studied. We give a complete discription of all positive $\alpha$ such that $G^{s}(n,n^{-\alpha})$ obeys…

In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in {1,...,n}. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a…

In this paper we prove the semi-circular law for the eigenvalues of regular random graph $G_{n,d}$ in the case $d\rightarrow \infty$, complementing a previous result of McKay for fixed $d$. We also obtain a upper bound on the infinity norm…

In this article, we establish some bounds involving the largest two distance Pareto eigenvalues of a connected graph. Also we characterize all possible values for smallest six distance Pareto eigenvalues of a connected graph.

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.

The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs.

A celebrated conjecture of Tuza states that in any finite graph the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. For an $r$-uniform hypergraph ($r$-graph) $G$, let…