相关论文: Resonance graphs of catacondensed even ring system…

In this paper we generalize the binary coding procedure of perfect matchings from catacondensed benzenoid graphs to catacondensed even ring systems (also called cers). Next, we study cers with isomorphic resonance graphs. For this purpose,…

We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as 2-connected outerplane bipartite…

It has recently been shown in [\emph{Discrete Appl. Math.} {\bf 366} (2025) 75--85] that the resonance graph of a plane elementary bipartite graph $G$ is a daisy cube if and only if $G$ is peripherally 2-colorable. Let $G$ be a peripherally…

Let $G$ be a plane elementary bipartite graph whose infinite face is forcing. We provide a bijection between the set of maximal hypercubes of its resonance graph and the set of maximal resonant sets of $G$, which generalizes a main result…

Klav\v{z}ar and Mollard introduced daisy cubes which are interesting isometric subgraphs of $ n$-cubes $Q_n$, induced with intervals between the maximal elements of a poset $ (V (Q_n),\leq)$ and the vertex $ 0^n \in V (Q_n)$. In this paper…

We prove that if $A$ and $B$ are daisy cubes whose $\tau$-graphs are forests, then $A$ and $B$ are isomorphic if and only if their $\tau$-graphs are isomorphic. The result is applied to show that a daisy cube with at least one edge is the…

Let $G$ be a graph embedded in a surface and let $\mathcal F$ be a set of even faces of $G$ (faces bounded by a cycle of even length). The resonance graph of $G$ with respect to $\mathcal F$, denoted by $R(G;\mathcal F)$, is a graph such…

Let R be a ring (not necessarily commutative ring) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in the form of ordered pair (e; u), where e is an idempotent of the ring R and u is a unit of the ring R. Two…

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Let $R$ be a ring (not necessarily a commutative ring) with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph with vertices in the form of an ordered pair $(e,u)$, where $e$ is an idempotent and $u$ is a unit of ring $R$,…

Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The…

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$ is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $x…

A dessin is a $2$-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper…

The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…

Let $R$ be a finite ring with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph whose vertices are pairs $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e, u)$ and $(f, v)$ are…

Let $G$ be a plane bipartite graph and $\mathcal{M}(G)$ be the set of all perfect matchings of $G$. The resonance graph $R(G)$ is a graph whose vertex set is $\mathcal{M}(G)$, and two perfect matchings are adjacent in $R(G)$ if their…

Cyclotron resonance (CR) is considered one of the fundamental phenomena in conducting systems. In this paper, we study CR in a gated two-dimensional (2D) electron system (ES). Namely, we analyze the absorption of electromagnetic radiation…

A fullerene graph $F$ is a planar cubic graph with exactly 12 pentagonal faces and other hexagonal faces. A set $\mathcal{H}$ of disjoint hexagons of $F$ is called a resonant pattern (or sextet pattern) if $F$ has a perfect matching $M$…

The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…

Let $R$ be a ring with unity. The clean graph $\text{Cl}(R)$ of a ring $R$ is the simple undirected graph whose vertices are of the form $(e,u)$, where $e$ is an idempotent element and $u$ is a unit of the ring $R$ and two vertices $(e,u)$,…