相关论文: Resonantly Equivalent Catacondensed Even Ring Syst…

In this paper, we provide a simple proof for the fact that two simplicial complexes are isomorphic if and only if their associated Stanley-Reisner rings, or their associated facet rings are isomorphic as $K$-algebras. As a consequence, we…

In this work we develop a simple equivalent circuit model (ECM) that predicts the spectral response of a lumped-element loaded single patterned layer reflective metasurface. The proposed ECM maintains accuracy across varying design…

Periodic arrays of sub-wavelength holes, due to a variety of applications (sensors, polarizers, filters) and unique abilities in manipulating different characteristics of impinging light, have been the subject of many studies in recent…

In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\"os-R\'enyi random graphs in a random environment. We show that the expected number of…

In analogy with the spectral theory of geometrically finite hyperbolic manifolds, we initiate the study of resonances on geometrically finite (q+1)-regular graphs of groups. We prove the meromorphic continuation of the resolvent of the…

Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

We recently found that the electromagnetic scattering problem can be very fast in an approach expressing the fields in terms of orthonormal basis functions. In this paper we apply computational conformal geometry with the conformal energy…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

Catacondensed benzenoids (those benzenoids having no carbon atom belonging to three hexagonal rings) form the simplest class of polycyclic aromatic hydrocarbons (PAH). They have a long history of study and are of wide chemical importance.…

The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a…

The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimal number of edges not in $M$ whose removal make $M$ as a unique perfect matching of the resulting graph. The anti-forcing spectrum of $G$ is the set of…

A matching $M$ of a graph $G$ is maximal if it is not a proper subset of any other matching in $G$. Maximal matchings are much less known and researched than their maximum and perfect counterparts. In particular, almost nothing is known…

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 commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

The accelerating trend of active metasurfaces -- such as those incorporating non-Foster matching, programmable control, or space-time modulation -- adds complexity to the computational electromagnetic (CEM) simulation landscape. In this…

For c in [0,1] let P_n(c) denote the set of n-vertex perfect graphs with density c and C_n(c) the set of n-vertex graphs without induced C_5 and with density c. We show that log|P_n(c)|/binom{n}{2}=log|C_n(c)|/binom{n}{2}=h(c)+o(1) with…

A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.

Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cospectrality implies singular cospectrality, but the converse…

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…