On Cayley's formula for counting trees in nested interval graphs
نویسندگان
چکیده
In this paper it is shown that the spectrum of a nested interval graph has a very simple structure. From this result a formula is derived to the number of spanning trees in a nested interval graph; this is a generalization of the Cayley formula.
منابع مشابه
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.
متن کاملCounting Spanning Out-trees in Multidigraphs
This paper generalizes an inclusion/exclusion counting formula of Temperley for the number of spanning trees of a graph based on its complement. The new formula is for the number of out-trees of a digraph which may have multiple arcs. This provides an extension of Temperley's formula to graphs with multiple edges. Determining which graphs have a maximum number of spanning trees is important for...
متن کاملOn the Classes of Interval Graphs of Limited Nesting and Count of Lengths
In 1969, Roberts introduced proper and unit interval graphs and proved that these classes are equal. Natural generalizations of unit interval graphs called k-length interval graphs were considered in which the number of different lengths of intervals is limited by k. Even after decades of research, no insight into their structure is known and the complexity of recognition is open even for k = 2...
متن کاملApplications of Graph Theory and Trees in the Cayley Theorem for Calculating the Number of Isomers in Compounds Alkanes
Cayley's theorem, in principle, can be used in determining the isomers of alkanes lot, which was originally limited to the calculation of the number of isomers of manual calculation, the method of "drawing and counting." Graph structure of the alkane is a tree (the tree). By proving that the alkane is a tree graph of a satisfying E (G) = V (G) with a value of V (G) = 3n + 2 and E (G) = 3n +1, -...
متن کاملA chip-firing variation and a new proof of Cayley's Formula
We introduce a variation of chip-firing games on connected graphs. These ‘burn-off’ games incorporate the loss of energy that may occur in the physical processes that classical chipfiring games have been used to model. For a graph G = (V,E), a configuration of ‘chips’ on its nodes is a mapping C : V → N. We study the configurations that can arise in the course of iterating a burn-off game. Afte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017