Related papers: Conditions for building generalized action graphs …
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…
We take a general approach to uncertainty on product spaces, and give sufficient conditions for the independence structures of uncertainty measures to satisfy graphoid properties. Since these conditions are arguably more intuitive than some…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is…
The subject of this paper is the elucidation of effects of actions from causal assumptions represented as a directed graph, and statistical knowledge given as a probability distribution. In particular, we are interested in predicting…
In this paper we present a method for constructing directed strongly regular graphs with assumed action of an automorphism group. The application of this method leads to first examples of directed strongly regular graphs with parameters…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be…
Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…