Related papers: Lifting and Folding: A Framework for Unstable Grap…

In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs $T$-equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that graphs $G$ and $G'$ are $T$-equivalent if $G'$ is obtained from…

Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…

The main eigenvalues of a graph $G$ are those eigenvalues of the $(0,1)$-adjacency matrix $\mathbf A$ having a corresponding eigenvector not orthogonal to $\mathbf j = (1,\dots,1)$. The CDC of a graph $G$ is the direct product $G\times…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…

Rallis and Soudry have proven the stability under twists by highly ramified characters of the local gamma factor arising from the doubling method, in the case of a symplectic group or orthogonal group G over a local non-archimedean field F…

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…

We study the $F$-decomposition threshold $\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can…

We demonstrate that when a graph exhibits a specific type of symmetry, it satisfies the Union Closed Conjecture(UCC). Additionally, we show that certain graph classes, such as Cylindrical Grid Graphs and Torus Grid Graphs also satisfy the…

If $f : \tilde{\Gamma} \rightarrow \Gamma$ is a covering map between connected graphs, and $H$ is the subgroup of $\pi_1(\Gamma,v)$ used to construct the cover, then it is well known that the group of deck transformations of the cover is…

We initiate the algorithmic study of the following "structured augmentation" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition…

In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $\Gamma$ and a vertex-transitive subgroup $G$ of $\mathrm{Aut}(\Gamma)$, a $2$-factor $\mathcal{C}$…

We study the coevolution of a generalized Glauber dynamics for Ising spins, with tunable threshold, and of the graph topology where the dynamics takes place. This simple coevolution dynamics generates a rich phase diagram in the space of…

This paper is a generalization of a previous paper by the author to connected unipotent linear algebraic groups. The notion of an $ \alpha $-pair answers when an open $ G $-stable, affine, sub-variety $ D(H) $ is a trivial bundle over $ G…

A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and…

The graph isomorphism is to determine whether two graphs are isomorphic. A closely related problem is automorphism detection, where an isomorphism between two graphs is a bijection between their vertex sets that preserves adjacency, and an…

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Recently, Man\v{c}inska and Roberson proved that two graphs $G$ and $G'$ are quantum isomorphic if and only if they admit the same number of homomorphisms from all planar graphs. We extend this result to planar #CSP with any pair of sets…