Transitivity of trees
| Autor: | Libin Chacko Samuel, Mayamma Joseph |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Discrete mathematics
Transitive relation TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer Science::Information Retrieval ComputingMethodologies_DOCUMENTANDTEXTPROCESSING Astrophysics::Instrumentation and Methods for Astrophysics Computer Science::General Literature Discrete Mathematics and Combinatorics Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | Discrete Mathematics, Algorithms and Applications. 14 |
| ISSN: | 1793-8317 1793-8309 |
| Popis: | For a graph [Formula: see text], a partition [Formula: see text] of the vertex set [Formula: see text] is a transitive partition if [Formula: see text] dominates [Formula: see text] whenever [Formula: see text]. The transitivity [Formula: see text] of a graph [Formula: see text] is the maximum order of a transitive partition of [Formula: see text]. For any positive integer [Formula: see text], we characterize the smallest tree with transitivity [Formula: see text] and obtain an algorithm to determine the transitivity of any tree of finite order. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|