Get started
Keyword

path graphs

Description: Path graphs are graphs whose vertices can be arranged in a linear sequence, with edges connecting consecutive vertices.
Wikidata ID: wiki/Q917421
OpenAlex ID: keywords/path-graphs
Partitioning Sparse Matrices with Eigenvectors of Graphs
1990 · Alex Pothen, Horst D. Simon, et al. · SIAM Journal on Matrix Analysis and Applications · 1,684
On the controllability of nearest neighbor interconnections
2004 · H.G. Tanner · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · 484
Minimizing Effective Resistance of a Graph
2008 · Arpita Ghosh, Stephen Boyd, et al. · SIAM Review · 447
Computing the Characteristic polynomial of a graph
1974 · Allen J. Schwenk · Lecture notes in mathematics · 362
Optimal sequence alignment using affine gap costs
1986 · Stephen F. Altschul, Bruce W. Erickson · Bulletin of Mathematical Biology · 234
On the Reachability and Observability of Path and Cycle Graphs
2011 · G. Parlangeli, G. Notarstefano · IEEE Transactions on Automatic Control · 223
Graphs with maximum connectivity index
2003 · Gilles Caporossi, Ivan Gutman, et al. · Computational Biology and Chemistry · 191
Dominating Sets in Chordal Graphs
1982 · Kellogg S. Booth, J. Howard Johnson · SIAM Journal on Computing · 176
Towards a practical lipreading system
2011 · Ziheng Zhou, Guoying Zhao, et al. · 167
The spectral radius of trees on k pendant vertices
2004 · Baofeng Wu, Enli Xiao, et al. · Linear Algebra and its Applications · 161
PDF
On the Wiener index of a graph
1991 · Ante Graovac, Toma? Pisanski · Journal of Mathematical Chemistry · 155
Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
2014 · Nima Monshizadeh, Shuo Zhang, et al. · IEEE Transactions on Automatic Control · 130
PDF
On the Algorithmic Complexity of Total Domination
1984 · Renu Laskar, John Pfaff, et al. · SIAM Journal on Algebraic and Discrete Methods · 123
A windowed graph Fourier transform
2012 · David I Shuman, Benjamin Ricaud, et al. · 120
Leaders in multi-agent controllability under consensus algorithm and tree topology
2012 · Zhijian Ji, Hai Lin, et al. · Systems & Control Letters · 116
A recognition algorithm for the intersection graphs of paths in trees
1978 · Fănică Gavril · Discrete Mathematics · 112
PDF
Finding connected components in map-reduce in logarithmic rounds
2013 · V. Rastogi, A. Machanavajjhala, et al. · Proceedings - International Conference on Data Engineering · 110
Perfect State Transfer in Quantum Walks on Graphs
2011 · Vivien M. Kendon, Christino Tamon · Journal of Computational and Theoretical Nanoscience · 109
Susceptible-infected-susceptible model: A comparison of N -intertwined and heterogeneous mean-field approximations
2012 · Cong Li, Ruud van de Bovenkamp, et al. · Physical Review E · 108
PDF
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
2006 · Elchanan Mossel, Ryan O'Donnell, et al. · Israel Journal of Mathematics · 100
Characterization of graphs using domination polynomials
2010 · Saieed Akbari, Saeid Alikhani, et al. · European Journal of Combinatorics · 98
PDF
Pseudoinverse of the Laplacian and best spreader node in a network
2017 · P. Van Mieghem, K. Devriendt, et al. · Physical review. E · 91
PDF
The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
1990 · Subhi N. Ruzieh, David L. Powers · Linear and Multilinear Algebra · 89
Distance spectral radius of trees with fixed maximum degree
2010 · Dragan Stevanovic, Aleksandar Ilic · Electronic Journal of Linear Algebra · 87
PDF
The k-centrum multi-facility location problem
2001 · Arie Tamir · Discrete Applied Mathematics · 87
PDF
Works count: 3,332
Citation count: 16,400
Year
Topic
Type