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

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(e), taken over all signed b-edge covers f of G, is called the signed b-edge cover number and is denoted by ρb(G). For any positive integer b, we show that a minimum signed b-edge cover can be found in polynomial time, using a reduction to b-edge cover, which itself is solved by b-matching. A sharp lower bound for ρb and a sharp upper bound ρ2 are given. A sharp upper bound for ρ ′ b of Cartesian product graphs is presented. Exact values of ρb for cliques and bicliques are found.

اسناد مشابه

  • Biclique Edge Cover Graphs and Confluent Drawings

    سند علمی۲۰۰۶Graph DrawingMichael Hirsch, Henk Meijer, David Rappaport

    Confluent drawing is a technique that allows some non-planar graphs to be visualized in a planar way. This approach merges edges together, drawing groups of them as single tracks, similar to train tracks. In the general case, producing confluent drawings automatically has proven

  • On the Minimal Sum of Edges in a Signed Edge-Dominated Graph

    مقاله‌ی دسترسی آزاد۲۰۲۲Electronic Journal of Combinatorics['Danila Cherkashin', 'Pavel Prozorov', '']

    Let $G$ be a simple graph with $n$ vertices and $\pm 1$-weights on edges. Suppose that for every edge $e$ the sum of edges adjacent to (including itself) is positive. Then weights over at least $-\frac{n^2}{25}$. Also we provide an example weighted described properties $-(1+o(1))

  • 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 edge cover polynomial of a graph

    سند علمی۲۰۱۳Eur. J. Comb.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=

  • Signed edge majority domination numbers in graphs

    سند علمی۲۰۰۸Australasian J. CombinatoricsHosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar

    The open neighborhood NG(e) of an edge e in a graph G is the set consisting of all edges having a common end-vertex with e and its closed neighborhood is NG[e] = NG(e) ∪ {e}. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑x∈NG[e] f(x) ≥ 1 for at least a

  • About The Edge Covers of the Graph

    سند علمی۲۰۱۷D. K. Thakkar, B. M. Kakrecha

    The paper is about the edge covers of the graph. The change in the edge covering number of the graph is observed under the operations vertex removal, edge removal and edge addition. The necessary and sufficient condition is proved under which the edge covering number decreases wh