Back to Search
Start Over
Counting maximal distance-independent sets in grid graphs
- Source :
- Discussiones Mathematicae Graph Theory, Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2013, 33 (3), pp.531-557. ⟨10.7151/dmgt.1707⟩, Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 531-557 (2013)
- Publication Year :
- 2013
- Publisher :
- HAL CCSD, 2013.
-
Abstract
- Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any l ∈ N, maximal distance-l independent (or simply: maximal l-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied.
- Subjects :
- Work (thermodynamics)
Fibonacci number
0102 computer and information sciences
02 engineering and technology
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
01 natural sciences
Combinatorics
padovan numbers
transfer matrix method
Transfer-matrix method
QA1-939
0202 electrical engineering, electronic engineering, information engineering
Discrete Mathematics and Combinatorics
Lattice graph
ComputingMilieux_MISCELLANEOUS
Mathematics
Discrete mathematics
Applied Mathematics
fibonacci
Grid
independent set
010201 computation theory & mathematics
Independent set
020201 artificial intelligence & image processing
Maximal independent set
grid graph
Subjects
Details
- Language :
- English
- ISSN :
- 12343099 and 20835892
- Database :
- OpenAIRE
- Journal :
- Discussiones Mathematicae Graph Theory, Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2013, 33 (3), pp.531-557. ⟨10.7151/dmgt.1707⟩, Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 531-557 (2013)
- Accession number :
- edsair.doi.dedup.....5b96e4165f10aa8205a3085734c898ff
- Full Text :
- https://doi.org/10.7151/dmgt.1707⟩