On graphs all of whose total dominating sequences have the same length.
Selim BahadirDidem GözüpekOguz DoganPublished in: Discret. Math. (2021)
Keyphrases
- fixed length
- hidden markov models
- graph theory
- data sets
- finite alphabet
- graph matching
- graph structure
- directed graph
- variable length
- graph databases
- longest common subsequence
- graph theoretic
- complex structures
- total length
- long sequences
- sequence matching
- subgraph isomorphism
- graph representation
- maximum number
- graph model
- feature vectors