Premium
Girth in digraphs
Author(s) -
Bermond J. C.,
Germa A.,
Heydemann M. C.,
Sotteau D.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040311
Subject(s) - digraph , combinatorics , mathematics , girth (graph theory) , integer (computer science) , order (exchange) , function (biology) , generating function , discrete mathematics , computer science , biology , finance , evolutionary biology , economics , programming language
For an integer k > 2, the best function m ( n, k ) is determined such that every strong digraph of order n with at least m ( n, k ) arcs contains a circuit of length k or less.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom