Related papers: A new class of reconstructible graphs

We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags…

We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

We briefly present a new construction of a 3-to-1 unrecoverable electrical network. This is a taste of a comprehensive forthcoming paper on unrecoverable electrical networks.

We complete a classification of the two-vertex geometrically irreducible algebras. We also classify the algebras in new classes of hom- and ext-irreducible algebras.

We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…

In this paper, we will consider the graph w*-probability theory.

A new family of maximal curves over a finite field is presented and some of their properties are investigated.

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

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…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

In this thesis we prove Schur-positivity of certain graph families. In addition, we exlpor existence of cyclic descent extensions on several families of Schur-positive sets.

This note provides new closed forms evaluations of a few classes of exponential sums associated with elliptic curves and hyperelliptic curves.

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…

A new kind of diagrams is presented, showing the causal structure of bimetric interactions.

We study topological properties of the graph topology.

Graphs are widely used as a popular representation of the network structure of connected data. Graph data can be found in a broad spectrum of application domains such as social systems, ecosystems, biological networks, knowledge graphs, and…

In this work, we show that the class of word-representable graphs is closed under split recomposition and determine the representation number of the graph obtained by recomposing two word-representable graphs. Accordingly, we show that the…

A classification is given of all the countable homogeneous ordered bipartite graphs.