Skip to search formSkip to main contentSkip to account menu

Graph enumeration

Known as: Enumeration of graphs, Graphical enumeration 
In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Caterpillar treeClaw-free graphDegree (graph theory)Directed acyclic graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the… 
2017
2017
ENUMERATION OF GRAPHS AND THE CHARACTERISTIC POLYNOMIAL OF THE HYPERPLANE ARRANGEMENTS Jn
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\cJ_n$ consisting of the hyperplanes… 
2015
2015
Edge-contraction on dual ribbon graphs, 2D TQFT, and the mirror of orbifold Hurwitz numbers
We present a new set of axioms for a 2D TQFT formulated on the category of the dual of ribbon graphs with edge-contraction… 
2013
2013
Combinatorial species and graph enumeration
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory… 
2012
2012
Algorithms , Combinatorics , Information , and Beyond Plenary Talk at ISIT
Shannon information theory aims at finding fundamental limits for storage and communication, including rates of convergence to… 
2009
2009
Graph properties and invariants, by their associate matrices
It will be very interesting to analyze the invariants and properties of graphs by their dierent associate matrices. So, we… 
2003
2003
Lower bounds for sense of direction in regular graphs
Abstract.A graph G with n vertices and maximum degree $\Delta_G$ cannot be given weak sense of direction using less than… 
Highly Cited
1994
Highly Cited
1994
A Computational Structure for Preattentive Perceptual Organization: Graphical Enumeration and Voting Methods
Presents an efficient computational structure for preattentive perceptual organization. By perceptual organization the authors… 
1988
1988
Investigations in Graphical Enumeration.
1979
1979
Enumeration of graphs by degree sequence
The degree sequence (d0, d1, …, dp-1) of a graph G of order p is defined by dk = the number of points of G of degree k. Methods… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)