منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملOn Counting Independent Sets in Sparse Graphs
We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree ∆. The first implies that the Markov chain Monte Carlo technique is likely to fail if ∆ ≥ 6. The second shows that no fully polynomial randomized approximation scheme can exist for ∆ ≥ 25, unless RP = NP.
متن کاملOn Counting Perfect Matchings in General Graphs
Counting perfect matchings has played a central role in the theory of counting problems. The permanent, corresponding to bipartite graphs, was shown to be #P-complete to compute exactly by Valiant (1979), and a fully polynomial randomized approximation scheme (FPRAS) was presented by Jerrum, Sinclair, and Vigoda (2004) using a Markov chain Monte Carlo (MCMC) approach. However, it has remained a...
متن کاملCounting and Sampling Problems on Eulerian Graphs
In this thesis we consider two sets of combinatorial structures defined on an Eulerian graph: the Eulerian orientations and Euler tours. We are interested in the computational problems of counting (computing the number of elements in the set) and sampling (generating a random element of the set). Specifically, we are interested in the question of when there exists an efficient algorithm for cou...
متن کاملCounting Representable Sets on Simple Graphs
The graph-colouring problem may be generalised by allowing arbitrary constraints to be speciied on the colour combinations permitted at each pair of adjacent nodes. A set of colourings which is the solution to some network of speciied constraints is said to be a representable set. This paper derives exact expressions for the number of representable sets when the corresponding graph is cycle-fre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aquila: The FGCU Student Research Journal
سال: 2019
ISSN: 2572-6005,2572-6021
DOI: 10.24049/aq.5.1.2