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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the… 
2017
2017
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\cJ_n$ consisting of the hyperplanes… 
2015
2015
We present a new set of axioms for a 2D TQFT formulated on the category of the dual of ribbon graphs with edge-contraction… 
2012
2012
Shannon information theory aims at finding fundamental limits for storage and communication, including rates of convergence to… 
2012
2012
Shannon information theory aims at finding fundamental limits for storage and communication, including rates of convergence to… 
2009
2009
It will be very interesting to analyze the invariants and properties of graphs by their dierent associate matrices. So, we… 
2003
2003
Abstract.A graph G with n vertices and maximum degree $\Delta_G$ cannot be given weak sense of direction using less than… 
1992
1992
Presents an efficient hierarchical computational paradigm for perceptual organization. Organization at each level of the… 
1979
1979
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…