Graphs : theory and algorithms /
by Olga Moreira.
- Burlington, Canada : Arcler Press, 2021
- 1 online resource (xxiii, 394, pages) : color illustrations.
https://portal.igpublish.com/iglibrary/ is required to read this e-book.
Include bibliographical references and index
1. Introduction -- 2. An image encryption algorithm based on random hamiltonian path -- 3. Traveling in networks with blinking nodes -- 4. On minimum spanning subgraphs of graphs with proper connection number 2 -- 5. New algorithm for calculating chromatic index of graphs and its applications -- 6. An edge-swap heuristic for finding dense spanning trees -- 7. Identifying network structure similarity using spectral graph theory -- 8.On generalized distance gaussian estrada index of graphs -- 9. Nullity and energy bounds of central graph of smith graphs -- 10.Induced subgraph saturated graphs -- 11. Connection and separation in hyper graphs -- 12. Vertex rough graphs -- 13. Incremental graph pattern matching algorithm for big graph data -- 14. Framework and algorithms for identifying honest blocks in block chain -- 15. Enabling controlling complex networks with local topological information -- 16. Estimation of traffic flow changes using networks in networks approaches -- 17. Hidden geometries in networks arising from cooperative self-assembly -- 18. Using graph theory to assess the interaction between cerebral function, brain hemodynamics, and systemic variables in premature infants
The book "Graphs:Theory and Algorithm" is a collection of modern articles features several graph-based methods and algorithms. It also covers important theoretical aspects pertaining to matrix representations of graphs such as the Laplacian and distance matrices which can be used for solving problems such that of the Hamiltonian and shortest path, as well as in finding minimum spanning trees and matching patterns.