Moving to Extremal Graph Parameters release_mzplvihkwrazdfwqqrits4vnqu

by P.J. Cameron, C.A. Glass, R.U. Schumacher

Released as a article .

2013  

Abstract

Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we develop a technique which provides answers for several different parameters: the numbers of edges in the line graph, acyclic orientations, cliques, and forests. (We minimize the first two and maximize the third and fourth.) Our technique involves two moves on the class of graphs. A compression move converts any graph to a form we call fully compressed: the fully compressed graphs are split graphs in which the neighbourhoods of points in the independent set are nested. A second consolidation move takes each fully compressed graph to one particular graph which we call H(n,m). We show monotonicity of the parameters listed for these moves in many cases, which enables us to obtain our results fairly simply. The paper concludes with some open problems and future directions.
In text/plain format

Archived Files and Locations

application/pdf  182.1 kB
file_net5lliz6zb2ri5c5qsxwagqs4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2013-07-22
Version   v1
Language   en ?
arXiv  1307.5781v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 53d57311-28d9-4cbf-b48e-bb165e027517
API URL: JSON