Related papers: Boundary Qoutinet Graphs and Graph Index
We introduce a variation of interval graphs, called veto interval (VI) graphs. A VI graph is represented by a set of closed intervals, each containing a point called a veto mark. The edge $ab$ is in the graph if the intervals corresponding…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
The inertia bound gives an upper bound on the independence number of a graph by considering the inertia of matrices corresponding to the graph. The bound is known to be tight for graphs on 10 or fewer vertices as well as for all perfect…
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…
Complex analyses involving multiple, dependent random quantities often lead to graphical models - a set of nodes denoting variables of interest, and corresponding edges denoting statistical interactions between nodes. To develop statistical…
Quantum Graphity is an approach to quantum gravity based on a background independent formulation of condensed matter systems on graphs. We summarize recent results obtained on the notion of emergent geometry from the point of view of a…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Arithmetic quotients are quotients of bounded symmetric domains by arithmetic groups, and modular subvarieties of arithmetic quotients are themselves arithmetic quotients of lower dimension which live on arithmetic quotients, by an…
We extend the Wirtinger number of links, an invariant originally defined by Blair, Kjuchukova, Velazquez, and Villanueva in terms of extending initial colorings of some strands of a diagram to the entire diagram, to spatial graphs. We prove…
In this paper, we introduce the concept of complementary edge ideals of graphs and study their algebraic properties and invariants.
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
Quantum theory has shown its superiority in enhancing machine learning. However, facilitating quantum theory to enhance graph learning is in its infancy. This survey investigates the current advances in quantum graph learning (QGL) from…
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…
Using the geometric quotient of a real algebraic set by the action of a finite group G, we construct invariants of GAS sets with respect to equivariant homeomorphisms with AS-graph, including additive invariants with values in Z.
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…