On 2k-Twisted Graphs
نویسندگان
چکیده
We define the concept of a k-twisted chain in a (directed) graph and the concept of a 2k-twisted graph. We show that for a 2k-twisted graph the set of algebraic 2k-twisted cycles is an integral spanning set for the integral flow module of G. Since a graph is O-twisted if and only if it is strongly connected, our result generalizes the well-known theorem that there is a basis for the flow space of a strongly connected graph consisting of algebraic circuits.
منابع مشابه
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...
متن کاملTwisted Hecke L-values and Period Polynomials
Let f1, . . . , fd be an orthogonal basis for the space of cusp forms of even weight 2k on Γ0(N). Let L(fi, s) and L(fi, χ, s) denote the L-function of fi and its twist by a Dirichlet character χ, respectively. In this note, we obtain a “trace formula” for the values L(fi, χ,m)L(fi, n) at integers m and n with 0 < m, n < 2k and proper parity. In the case N = 1 or N = 2, the formula gives us a c...
متن کاملProperties of Certain Families of 2k-Cycle-Free Graphs
Let v = v(G) and e = e(G) denote the order and size of a simple graph G, respectively. Let G = {Gi}i≥1 be a family of simple graphs of magnitude r > 1 and constant λ > 0, i.e. e(Gi) = (λ+ o(1))v(Gi), i→∞. For any such family G whose members are bipartite and of girth at least 2k + 2, and every integer t, 2 ≤ t ≤ k − 1, we construct a family G̃t of graphs of same magnitude r, of constant greater ...
متن کاملOn the index of bicyclic graphs with perfect matchings
Let B(2k) be the set of all bicyclic graphs on 2k(k¿ 2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with maximal index in B(2k). c © 2004 Elsevier B.V. All rights reserved. MSC: 05c50
متن کاملA Property of Walks in Graphs
The aim of this note is to call attention to a peculiar odd–even regularity regarding the number of walks in a finite graph G: Let Wk denote the number of walks of length k (≥ 0) in G and put ∆k := Wk+1Wk−1−W 2 k (k ≥ 1) . Then • ∆2k−1 ≥ 0 holds for all k ≥ 1, • one has either ∆1 ≥ 0 and ∆k = 0 for all k ≥ 2 which holds if and only if G is harmonic (i.e. if and only if the degree map which asso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 1987