Premium
Infinite median graphs, (0, 2)‐graphs, and hypercubes
Author(s) -
Bandelt HansJ.,
Mulder Henry Martyn
Publication year - 1983
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.3190070415
Subject(s) - combinatorics , hypercube , bipartite graph , mathematics , chordal graph , indifference graph , discrete mathematics , cardinality (data modeling) , interval (graph theory) , pathwidth , graph , computer science , line graph , data mining
Hypercubes are characterized among connected bipartite graphs by interval conditions in several ways. These results are based on the following two facts: (i) connected bipartite graphs are median provided that all their intervals induce median graphs, and (ii) median (0, 2)‐graphs are hypercubes. No cardinality restrictions are made.
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