Construction numbers: How to build a graph?

02/25/2023
by   Paul C. Kainen, et al.
0

We count the number of ways to build paths, stars, cycles, and complete graphs as a sequence of vertices and edges, where each edge follows both of its endpoints. The problem was considered 50 years ago by Stanley but the explicit sequences corresponding to graph families seem to have been little studied. A cost-based variant is introduced and applications are considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2019

On the m-eternal Domination Number of Cactus Graphs

Given a graph G, guards are placed on vertices of G. Then vertices are s...
research
05/11/2020

On the Graceful Game

A graceful labeling of a graph G with m edges consists of labeling the v...
research
06/12/2019

Broadcasts on Paths and Cycles

A broadcast on a graph G=(V,E) is a function f: V⟶{0,...,diam(G)} such t...
research
01/05/2023

Sum Labelling Graphs of Maximum Degree Two

The concept of sum labelling was introduced in 1990 by Harary. A graph i...
research
09/08/2020

Edge Degeneracy: Algorithmic and Structural Results

We consider a cops and robber game where the cops are blocking edges of ...
research
04/01/2021

Using Graph Theory to Derive Inequalities for the Bell Numbers

The Bell numbers count the number of different ways to partition a set o...
research
11/30/2020

A Bijection Between Weighted Dyck Paths and 1234-avoiding Up-Down Permutations

Three-dimensional Catalan numbers are a variant of the classical (bidime...

Please sign up or login with your details

Forgot password? Click here to reset