Connection between conjunctive capacity and structural properties of graphs

Miroslav Chlebik, Janka Chlebikova

Research output: Contribution to journalArticlepeer-review

74 Downloads (Pure)

Abstract

The investigation of the asymptotic behaviour of various graph parameters in powers of a graph is motivated by problems in information theory and extremal combinatorics. Considering various parameters and/or various notions of graph powers we can arrive at different notions of graph capacities, of which the Shannon capacity is best known. Here we study a related notion of the so-called conjunctive capacity of a graph G, CAND(G), introduced and studied by Gargano,  Körner and Vaccaro. To determine CAND(G) is a convex programming problem. We show that the optimal solution to this problem is unique and describe the structure of the solution in any (simple) graph. We prove that its reciprocal value vcC(G):=1/CAND(G) is an optimal solution of the newly introduced problem of Minimum Capacitary Vertex Cover that is closely related to the LP-relaxation of the Minimum Vertex Cover Problem. We also describe its close connection with the binding number/binding set of a graph, and with the strong crown decomposition of graphs.
Original languageEnglish
Pages (from-to)109-118
JournalTheoretical Computer Science
Volume554
Early online date10 May 2014
DOIs
Publication statusPublished - 16 Oct 2014

Keywords

  • Graph capacities
  • compound channel
  • Shannon capacity for graph families
  • fractional vertex cover
  • binding number
  • strong crown decomposition

Fingerprint

Dive into the research topics of 'Connection between conjunctive capacity and structural properties of graphs'. Together they form a unique fingerprint.

Cite this