Related papers: Godsil-McKay switching and twisted Grassmann graph…
Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…
Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…
We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by…
Understanding the mechanisms governing the optical activity of layered-stacked materials is crucial to the design of devices aimed at manipulating light at the nanoscale. Here, we show that both twisted and slid bilayer graphene are chiral…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
Plasmons in van der Waals heterostructures comprised of graphene and related layered materials demonstrate deep subwavelength confinement and large propagation length. In this letter, we show that graphene-insulator-graphene tunnel…
We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.
The study of Feynman rules is much facilitated by the two Symanzik polynomials, homogeneous polynomials based on edge variables for a given Feynman graph. We review here the role of a recently discovered third graph polynomial based on…
We consider a graphene sheet encapsulated in a two-dimensional metallic grating and a substrate ($\mathrm{Al_{2}O_{3}}$) and subjected to an external magnetic field (in Faraday configuration). The grating consists of a thin perfectly…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…
The class of generalized Petersen graphs was introduced by Coxeter in the 1950s. Frucht, Graver and Watkins determined the automorphism groups of generalized Petersen graphs in 1971, and much later, Nedela and \v{S}koviera and…
Van der Waals heterostructures obtained by artificially stacking two-dimensional crystals represent the frontier of material engineering, demonstrating properties superior to those of the starting materials. Fine control of the interlayer…
Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…
We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…
We consider gauged sigma-models from a Riemann surface into a Kaehler and hamiltonian G-manifold X. The supersymmetric N=2 theory can always be twisted to produce a gauged A-model. This model localizes to the moduli space of solutions of…
In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic…
It is shown how the graph category of Borisov and Manin can be constructed from (a variant of) the graph category of Joyal and Kock, essentially by reversing the generic morphisms. More precisely, the morphisms in the Borisov-Manin category…
The extreme versatility of two-dimensional van der Waals (vdW) materials derives from their ability to exhibit new electronic properties when assembled in proximity with dissimilar crystals. For example, although graphene is inherently…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…