Generalized Characteristic Polynomials of Join Graphs and Their Applications
نویسندگان
چکیده
منابع مشابه
Generalized Jacobi polynomials/functions and their applications
We introduce a family of generalized Jacobi polynomials/functions with indexes α,β ∈ R which are mutually orthogonal with respect to the corresponding Jacobi weights and which inherit selected important properties of the classical Jacobi polynomials. We establish their basic approximation properties in suitably weighted Sobolev spaces. As an example of their applications, we show that the gener...
متن کاملChromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the chromatic polynomials of generalized vertex joins of trees, and by duality we find the flow polynomials of arbitrary outerplanar graphs. We also present closed formulas for the chromatic and flow polynomials of vertex...
متن کاملToric Generalized Characteristic Polynomials
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over an algebraically closed field) of any n by n system of polynomial equations. Since we use the sparse resultant, we thus obtain complexity bounds (for converti...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملOn properties of adjoint polynomials of graphs and their applications
For a graph G, we denote by P (G, λ) the chromatic polynomial of G and by h(G, x) the adjoint polynomial of G. A graph G is said to be chromatically unique if for any graph H, P (H, λ) = P (G, λ) implies H ∼= G. In this paper, we investigate some algebraic properties of the adjoint polynomials of some graphs. Using these properties, we obtain necessary and sufficient conditions for Kn − E(∪a,bT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2017
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2017/2372931