Premium
Monotone sequences of graphical invariants
Author(s) -
Harary Frank,
Kabell Jerald A.
Publication year - 1980
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230100308
Subject(s) - monotone polygon , disjoint sets , sequence (biology) , combinatorics , context (archaeology) , mathematics , point (geometry) , group (periodic table) , line (geometry) , discrete mathematics , computer science , paleontology , chemistry , genetics , geometry , organic chemistry , biology
We investigate the extent to which certain graphical parameters can vary in successive point‐deleted subgraphs. In particular we identify one group of invariants which can be made to conform to an arbitrary monotone nondecreasing sequence and another group to a given nonincreasing sequence. Curiously, the two sets are not disjoint, as the line connectivity is in both. Finally we determine the most general sequences which can appear in this context.