Related papers: Enumerating threshold graphs and some related grap…

Graph pebbling considers the problem of transforming configurations of discrete pebbles to certain target configurations on the vertices of a graph, using the so-called pebbling move. This paper provides counterexamples to a monotonicity…

We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to…

We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…

The celebrated Erdos, Faber and Lovasz conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an…

We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…

There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class…

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the \emph{sum index} of this graph. In this paper, we present…

We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected…

We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest, the number of cells, and the number of columns. The…

Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…

Starting with an isolated vertex, here we construct a threshold hypergraph by repeatedly adding an isolated vertex or a $k$-dominating vertex set. We represent a threshold hypergraph by a string of non-negative integers and find the…

We study semigroups of labellings associated to a graph. These generalize the Jukes-Cantor model and phylogenetic toric varieties defined by Buczy\'nska. Our main theorem bounds the degree of the generators of the semigroup by g+1 when the…

In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a…

We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…

We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…

We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well…

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…