ویراساینس.
سند علمی

On the edge cover polynomial of a graph

Saieed Akbari, Mohammad Reza Oboudi

چکیده

Let G be a simple graph of order n and size m. An edge covering of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set. Here we introduce a new graph polynomial. The edge cover polynomial of G is the polynomial E(G, x) = ∑m i=1 e(G, i)x , where e(G, i) is the number of edge covering sets of G of size i. Let G and H be two graphs of order n such that δ(G) ≥ n 2 , where δ(G) is the minimum degree of G. If E(G, x) = E(H, x), then we show that the degree sequence of G and H are the same. We show that cycles and complete bipartite graphs are determined by their edge cover polynomials. Also we determine all graphs G for which E(G, x) = E(Pn, x), where Pn is the path of order n. We show that if δ(G) ≥ 3, then E(G, x) has at least one non-real root. We prove that the real roots of edge cover polynomial of trees are dense in the interval [−4,0]. Finally, we characterize all graphs whose edge cover polynomials have exactly one or two distinct roots. In fact their roots are contained in {−3,−2,−1, 0}. 2010 AMS Subject Classification: 05C31; 05C70.

اسناد مشابه

  • on the edge cover polynomial of certain graphs

    مقاله۲۰۱۵journal of algebraic systemssaeid alikhani, sommayeh jahari

    let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is t

  • ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS

    مقاله۲۰۱۵Journal of Algebraic SystemsS. Alikhani, S. Jahari

    Let $G$ be a simple graph of order $n$ and size $m$. The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$, where $e(G,i)$ is

  • On the roots of edge cover polynomials of graphs

    سند علمی۲۰۱۱Eur. J. Comb.Péter Csikvári, Mohammad Reza Oboudi

    Let G be a simple graph of order n and size m. An edge covering of the graph G is a set of edges such that every vertex of the graph is incident to at least one edge of the set. Let e(G, k) be the number of edge covering sets of G of size k. The edge cover polynomial of G is the

  • Signed B-edge Covers of Graphs

    سند علمی۲۰۰۷ANTHONY BONATO, CHANGPING WANG

    We study a signed variant of edge covers of graphs. Let b be a positive integer, and let G be a graph with minimum degree at least b. A signed b-edge cover of G is a function f : E(G) → {−1, 1} satisfying e∈EG(v) f(e) ≥ b for every v ∈ V (G). The minimum of the values of e∈E(G) f

  • Signed (b, k)-Edge Covers in Graphs

    سند علمی۲۰۱۰Intelligent Information ManagementA. N. Ghameshlou, Abdollah Khodkar, Reza Saei, Seyed Mahmoud Sheikholeslami

    Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and b are positive integers. A function is said to be a signed -edge cover of G if G ( ) V G ( ) e E v ( ) E G G : ( f E k b k ) { 1,1} G   ( , ) b k ( ) f e b    for a

  • On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs

    مقاله‌ی دسترسی آزاد۲۰۱۹FilomatMohammadOboudi