On some extremal problems in graph theory

Simple item page
dc.creatorJakobson, Dmitry
dc.creatorRivin, Igor
dc.date1999-07-08
dc.date.accessioned2026-07-07T05:29:50Z
dc.date.available2026-07-07T05:29:50Z
dc.descriptionIn this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to one in analysis. We study both weighted and unweighted graphs which are extremal for these invariants. In the unweighted case we concentrate on finding extrema among all (usually) regular graphs with the same number of vertices; we also study the relationships between such graphs.
dc.descriptionJune 1998 Preprint
dc.identifierhttps://arxiv.org/abs/math/9907050
dc.identifierhttp://arxiv.org/abs/math/9907050
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78792
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subjectRings and Algebras
dc.subjectSpectral Theory
dc.subject05C35;05C85;49K35;90C35
dc.titleOn some extremal problems in graph theory
dc.typetext

Files

Collections

arXiv