The Tutte Polynomial of a Graph, Depth-first Search
نویسندگان
چکیده
منابع مشابه
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
One of the most important numerical quantities that can be computed from a graph G is the two-variable Tutte polynomial. Specializations of the Tutte polynomial count various objects associated with G, e.g., subgraphs, spanning trees, acyclic orientations, inversions and parking functions. We show that by partitioning certain simplicial complexes related to G into intervals, one can provide com...
متن کاملGraph invariants, homomorphisms, and the Tutte polynomial
There are various ways to define the chromatic polynomial P (G; z) of a graph G. Perhaps the first that springs to mind is to define it to be the graph invariant P (G; k) with the property that when k is a positive integer P (G; k) is the number of colourings of the vertices of G with k or fewer colours such that adjacent vertices receive different colours. One then has to prove that P (G; k) i...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملDepth-First Search and Linear Graph Algorithms
The value of depth-first search or "bacltracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by k1V + k2E dk for so...
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1995
ISSN: 1077-8926
DOI: 10.37236/1267