Related papers: Graphs with large girth and nonnegative curvature …
In this paper we introduce the nullity of signed graphs, and give some results on the nullity of signed graphs with pendant trees. We characterize the unicyclic signed graphs of order n with nullity n-2; n-3; n-4; n-5 respectively.
Let $G$ be a contraction critically quasi $5$-connected graph on at least $14$ vertices. If there is a vertex $x\in V_{4}(G)$ such that $G[N_{G}(x)]\cong K_{1,3}$ or $G[N_{G}(x)]\cong C_{4}$, then $G$ has a quasi $5$-contractible subgraph…
An oriented graph $\overrightarrow{G}$ is pushably $k$-critical if it is not pushably $k$-colorable, but every proper subgraph of $\overrightarrow{G}$ is. The main result of this article is that every pushably $3$-critical oriented graph on…
The number of the positive, negative and zero eigenvalues in the spectrum of the (edge)-weighted graph $G$ are called positive inertia index, negative inertia index and nullity of the weighted graph $G$, and denoted by $i_+(G)$, $i_-(G)$,…
We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…
We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least~5 in this class is…
Topological indices are important bridge between graph theory and chemical applications. The study of graph matching expandability has been an influential topic in recent research on graph structure. In this paper, we provide some…
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of $H$-free split graphs whose clique-width is…
In this paper, we show that all simple outerplanar graphs $G$ with minimum degree at least $2$ and positive Lin-Lu-Yau Ricci curvature on every edge have maximum degree at most $9$. Furthermore, if $G$ is maximally outerplanar, then $G$ has…
The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first non-trivial algorithm for the problem, given by Djidjev,…
In this note a new measure of irregularity of a simple undirected graph $G$ is introduced. It is named the total irregularity of a graph and is defined as $\irr_t(G) = 1/2\sum_{u,v \in V(G)} |d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the…
In this paper, we characterize all unmixed d-uniform r-partite hypergraphs under a certain condition. Also we give a necessary condition for unmixedness in d-uniform hypergraphs with a perfect matching of size n. Finally we give a…
In this paper, we prove that any simple $\{C_3,C_5\}$-free non-empty connected graph $G$ with LLY curvature bounded below by $\kappa>0$ has the order at most $2^{\frac{2}{\kappa}}$. This upper bound is achieved if and only if $G$ is a…
A set D of vertices of a graph G=(V,E) is irredundant if each v of D satisfies (a) v is isolated in the subgraph induced by D, or (b) v is adjacent to a vertex in V-D that is nonadjacent to all other vertices in D. The upper irredundance…
Nowhere dense graph classes provide one of the least restrictive notions of sparsity for graphs. Several equivalent characterizations of nowhere dense classes have been obtained over the years, using a wide range of combinatorial objects.…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
We obtain a bound on the girth g of a quaternion unit gain graph in terms of the rank r of its adjacency matrix. In particular, we show that g <= r + 2 and characterize all quaternion unit gain graphs for which g = r+2. This extends…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
We prove that all currently known examples of manifolds with nonnegative sectional curvature satisfy a stronger condition: their curvature operator can be modified with a 4-form to become positive-semidefinite.