English
Related papers

Related papers: Godsil-McKay switching and isomorphism

200 papers

A \emph{mixed dihedral group} is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper we give a sufficient condition…

Combinatorics · Mathematics 2023-04-24 Daniel R. Hawtin , Cheryl E. Praeger , Jin-Xin Zhou

Let $M\circ N$ denote the Schur product of two matrices $M$ and $N$. A graph $X$ with adjacency matrix $A$ is walk regular if $A^k\circ I$ is a constant times $I$ for each $k\ge0$, and $X$ is 1-walk-regular if it is walk regular and…

Combinatorics · Mathematics 2025-01-28 Chris Godsil , Wanting Sun , Xiaohong Zhang

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

Combinatorics · Mathematics 2016-11-08 Ameneh Farhadian

We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…

Combinatorics · Mathematics 2015-11-12 Allana S. S. de Oliveira , Cybele T. M. Vinagre

Not necessarily self-adjoint quantum graphs -- differential operators on metric graphs -- are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) $ \mathcal P $. If the differential operator…

Mathematical Physics · Physics 2017-03-06 P. Kurasov , B. Majidzadeh Garjani

We show that if a non-amenable, quasi-transitive, unimodular graph $G$ has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and outdegree. This result involves extending earlier…

Probability · Mathematics 2023-08-15 Ferenc Bencs , Aranka Hrušková , László Márton Tóth

Let $\mathbf{G}=\{G_1,\dots,G_{s}\}$ be a collection of $s$ bipartite graphs with the same bipartition $V=(X,Y)$. For a path $P$ with $V(P)=V$ and $|E(P)|=s$, if there exists an injection $\phi$: $E(P)\rightarrow [s]$ such that $e\in…

Combinatorics · Mathematics 2026-03-11 Menghan Ma , Lihua You , Xiaoxue Zhang

We compare the spectral properties of two kinds of linear operators characterizing the (classical) geodesic flow and its quantization on connected locally finite graphs without dead ends. The first kind are transfer operators acting on…

Spectral Theory · Mathematics 2023-07-21 Kai-Uwe Bux , Joachim Hilgert , Tobias Weich

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

Group Theory · Mathematics 2013-04-18 Alireza Abdollahi , Hamid Shahverdi

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…

Spectral Theory · Mathematics 2016-04-12 Jutirekha Dutta , Rajat Kanti Nath

It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.

Logic in Computer Science · Computer Science 2007-05-23 Joost Engelfriet , Sebastian Maneth

In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$. The spectrum of $G$ is referring to its adjacency…

Combinatorics · Mathematics 2025-07-22 Yi-Zheng Fan , Hong-Xia Yang , Jian Zheng

This paper gives a sufficient and necessary condition for the existence of an (X, s)-arc-transitive imprimitive graph which is not a multicover of a given quotient graph.

Combinatorics · Mathematics 2015-01-06 Bin Jia

Let $D$ be a weighted oriented graph, whose underlying graph is $G$, and let $I(D)$ be its edge ideal. If $G$ has no $3$-, $5$-, or $7$-cycles, or $G$ is K\"{o}nig, we characterize when $I(D)$ is unmixed. If $G$ has no $3$- or $5$-cycles,…

Commutative Algebra · Mathematics 2019-10-01 Yuriko Pitones , Enrique Reyes , Rafael H. Villarreal

Link prediction is central to many real-world applications, but its performance may be hampered when the graph of interest is sparse. To alleviate issues caused by sparsity, we investigate a previously overlooked phenomenon: in many cases,…

Machine Learning · Computer Science 2023-06-21 Wenqing Zheng , Edward W Huang , Nikhil Rao , Zhangyang Wang , Karthik Subbian

We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…

Group Theory · Mathematics 2021-09-30 Max Carter , Stephan Tornier , George A. Willis

Let $\A$ and $\B$ be operator algebras with $c_0$-isomorphic diagonals and let $\K$ denote the compact operators. We show that if $\A\otimes\K$ and $\B\otimes\K$ are isometrically isomorphic, then $\A$ and $\B$ are isometrically isomorphic.…

Operator Algebras · Mathematics 2023-06-22 Evgenios Kakariadis , Elias Katsoulis , Xin Li

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

Combinatorics · Mathematics 2021-03-30 Jiangmin Pan , Binzhou Xia , Fugang Yin

We introduce a nonreciprocal nongyrotropic magnetless metasurface. In contrast to previous nonreciprocal structures, this metasurface does not require a biasing magnet, and is therefore lightweight and amenable to integrated circuit…

Classical Physics · Physics 2017-08-02 Sajjad Taravati , Bakhtiar A. Khan , Shulabh Gupta , Karim Achouri , Christophe Caloz

A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…

Combinatorics · Mathematics 2021-11-08 Pepijn Wissing
‹ Prev 1 8 9 10 Next ›