CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Authors
Christophe J.
S. Dewez
+8 more
Doignon J.-P.
S. Elloumi
Fasbender G.
Grégoire P.
D. Huygens
M. Labbé
Mélot H.
Yaman H.
Publication date
1 January 2008
Publisher
'Wiley'
Doi
Cite
Abstract
Optimality of a linear inequality in finitely many graph invariants is defined through a geometric approach. For a fixed number of graph vertices, consider all the tuples of values taken by the invariants on a selected class of graphs. Then form the polytope which is the convex hull of all these tuples. By definition, the optimal linear inequalities correspond to the facets of this polytope. They are finite in number, are logically independent, and generate precisely all the linear inequalities valid on the class of graphs. The computer system GraPHedron, developed by some of the authors, is able to produce experimental data about such inequalities for a "small" number of vertices. It greatly helps in conjecturing optimal linear inequalities, which are then hopefully proved for any number of vertices. Two examples are investigated here for the class of connected graphs. First, all the optimal linear inequalities for the stability number and the number of edges are obtained. To this aim, a problem of Ore (1962) related to the Turán Theorem (1941) is solved. Second, several optimal inequalities are established for three invariants: the maximum degree, the irregularity, and the diameter. © 2008 Wiley Periodicals, Inc
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Bilkent University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.bilkent.edu.tr:...
Last time updated on 12/11/2016