Polynomial relations between matrices of graphs
نویسندگان
چکیده
منابع مشابه
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...
متن کاملLinear Relations between Polynomial Orbits
We study the orbits of a polynomial f ∈ C[X], namely the sets {α, f(α), f(f(α)), . . . } with α ∈ C. We prove that if two nonlinear complex polynomials f, g have orbits with infinite intersection, then f and g have a common iterate. More generally, we describe the intersection of any line in C with a d-tuple of orbits of nonlinear polynomials, and we formulate a question which generalizes both ...
متن کاملRelations Between Graphs
Given two graphs G = (VG, EG) and H = (VH , EH), we ask under which conditions there is a relation R ⊆ VG × VH that generates the edges of H given the structure of the graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective homomorphisms of graphs and naturally leads to notions of R-retractions, Rcores, and R-cocores of graphs. Both R-cores and R-cocores...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملRecurrence Relations for Polynomial Sequences via Riordan Matrices
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024
DOI: 10.1002/jgt.22401