相关论文: A spectral condition for odd cycles in graphs
We prove that an inseparable graph can have any positive number of cycles with the six exceptions 2, 4, 5, 8, 9, 16, and that an inseparable cubic graph has the additional exceptions 1 and 13. The exceptions for simple inseparable cubic…
An {\it odd $c$-coloring} of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing an odd number of times on its neighborhood. This concept was introduced very recently by Petru\v sevski and \v Skrekovski…
For integers $k \geq 2$ and $n \geq k+1$, we prove the following: If $n\cdot k$ is even, there is a connected $k$-regular graph on $n$ vertices. If $n\cdot k$ is odd, there is a connected nearly $k$-regular graph on $n$ vertices.
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the…
For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…
A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we…
We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…
We consider the stability of periodic map with period-$2$ in linear fractional difference equations where the function is $f(x)=ax$ at even times and $f(x)=bx$ at odd times. The stability of such a map for an integer order map depends on…
A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs…
In this short paper, we introduce a new vertex coloring whose motivation comes from our series on odd edge-colorings of graphs. A proper vertex coloring $\varphi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\in V(G)$…
Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general,…
Given a graph $G$, a vertex-colouring $\sigma$ of $G$, and a subset $X\subseteq V(G)$, a colour $x \in \sigma(X)$ is said to be \emph{odd} for $X$ in $\sigma$ if it has an odd number of occurrences in $X$. We say that $\sigma$ is an…
The canonical double cover $\mathrm{D}(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(\Gamma))=\mathrm{Aut}(\Gamma)\times\mathbb{Z}_2$ then $\Gamma$ is called stable; otherwise $\Gamma$…
A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a cyclic interval $t$-coloring if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…
Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.
We prove that for every $d\in \mathbb{N}$ and a graph class of bounded expansion $\mathscr{C}$, there exists some $c\in \mathbb{N}$ so that every graph from $\mathscr{C}$ admits a proper coloring with at most $c$ colors satisfying the…