Related papers: On Delta Graphs and Delta Conjecture
We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.
Let $\chi'_\subset(G)$ be the least number of colours necessary to properly colour the edges of a graph $G$ with minimum degree $\delta\geq 2$ so that the set of colours incident with any vertex is not contained in a set of colours incident…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…
A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…
Reed conjectured that for every graph, $\chi \leq \left \lceil \frac{\Delta + \omega + 1}{2} \right \rceil$ holds, where $\chi$, $\omega$ and $\Delta$ denote the chromatic number, clique number and maximum degree of the graph, respectively.…
In this paper, we introduce a new family of graphs, $\Gamma(n,a)$. We show that it is an infinite family of tetravalent half-transitive Cayley graphs. Apart from that, we determine some structural properties of $\Gamma(n,a)$.
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…
The $\delta$-complement $G_\delta$ of a graph $G$, introduced in 2022 by Pai et al., is a variant of the graph complement, where two vertices are adjacent in $G_\delta$ if and only if they are of the same degree but not adjacent in $G$ or…
The second author's $\omega$, $\Delta$, $\chi$ conjecture proposes that every graph satisties $\chi \leq \lceil \frac 12 (\Delta+1+\omega)\rceil$. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses…
Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…
A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…
A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. We construct a new infinite families of $k$-vertex-critical $(P_5,C_5)$-free graphs for all $k\ge 6$. Our construction generalizes known constructions for…
For a group $G$, we define a graph $\Delta(G)$ by letting $G^{\#} = G \setminus \{ 1 \}$ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\#}$ if and only if the subgroup $\langle x,y\rangle$ is cyclic.…
We systematically determine circular chromatic index of small graphs and multigraphs with maximum degree $4$, $5$, $6$ (and also their number for a given small order). We construct several infinite families of such graphs with circular…
In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S…
Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide. We use this…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…
The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. A basic property of the critical ideals of graphs asserts that the graphs with at most k trivial critical ideals,…