Counting geodesic paths in graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Knor, Martin, Sedlar, Jelena, Škrekovski, Riste, Zhang, Xiao-Dong |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025)
by: Knor, Martin, et al.
Published: (2025)
Invitation to the subpath number
by: Knor, Martin, et al.
Published: (2025)
by: Knor, Martin, et al.
Published: (2025)
Fault tolerance of metric basis can be expensive
by: Knor, Martin, et al.
Published: (2024)
by: Knor, Martin, et al.
Published: (2024)
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
by: Sedlar, Jelena, et al.
Published: (2023)
by: Sedlar, Jelena, et al.
Published: (2023)
Proper Z4 x Z2-colorings: structural characterization with application to some snarks
by: Sedlar, Jelena, et al.
Published: (2024)
by: Sedlar, Jelena, et al.
Published: (2024)
Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)
by: Bermudo, Sergio, et al.
Published: (2024)
On regular graphs with Šoltés vertices
by: Bašić, Nino, et al.
Published: (2023)
by: Bašić, Nino, et al.
Published: (2023)
Some results on $σ_{t}$-irregularity
by: Filipovski, Slobodan, et al.
Published: (2024)
by: Filipovski, Slobodan, et al.
Published: (2024)
The maximum number of paths of a given length in a nonhamiltonian graph
by: Li, Chengli, et al.
Published: (2026)
by: Li, Chengli, et al.
Published: (2026)
Counting Small Cycle Double Covers
by: Jooken, Jorik, et al.
Published: (2025)
by: Jooken, Jorik, et al.
Published: (2025)
The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)
by: Liu, Xining, et al.
Published: (2026)
Counting $k$-cycles in $5$-connected planar triangulations
by: Agrahari, Gyaneshwar, et al.
Published: (2025)
by: Agrahari, Gyaneshwar, et al.
Published: (2025)
A matrix for counting paths in acyclic colored digraphs
by: Bera, Sudip
Published: (2022)
by: Bera, Sudip
Published: (2022)
Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)
by: Kashima, Masaki, et al.
Published: (2025)
Hamiltonian paths in iterated line graphs
by: Ekstein, Jan, et al.
Published: (2025)
by: Ekstein, Jan, et al.
Published: (2025)
The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Diameter of General Knödel Graphs
by: Musawi, Seyed Reza, et al.
Published: (2020)
by: Musawi, Seyed Reza, et al.
Published: (2020)
Two sufficient conditions for graphs to admit path factors
by: Zhou, Sizhong, et al.
Published: (2023)
by: Zhou, Sizhong, et al.
Published: (2023)
Counting paths in directed graphs
by: Hajac, Piotr M., et al.
Published: (2022)
by: Hajac, Piotr M., et al.
Published: (2022)
The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Closing paths to cycles in symmetric graphs
by: Milanič, Martin, et al.
Published: (2025)
by: Milanič, Martin, et al.
Published: (2025)
Aα-spectral radius and path-factor covered graphs
by: Zhou, Sizhong, et al.
Published: (2024)
by: Zhou, Sizhong, et al.
Published: (2024)
Solution to a $3$-path isolation problem for subcubic graphs
by: Bartolo, Karl, et al.
Published: (2024)
by: Bartolo, Karl, et al.
Published: (2024)
An extension of the Lindström-Gessel-Viennot theorem
by: Lee, Yi-Lin
Published: (2021)
by: Lee, Yi-Lin
Published: (2021)
Long induced paths in $K_{s, s}$-free graphs
by: Hunter, Zach, et al.
Published: (2024)
by: Hunter, Zach, et al.
Published: (2024)
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
by: Attwa, Yamaan, et al.
Published: (2026)
by: Attwa, Yamaan, et al.
Published: (2026)
Bound vertices of longest paths between two vertices in cubic graphs
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
Results on proper conflict-free list coloring of graphs
by: Kashima, Masaki, et al.
Published: (2025)
by: Kashima, Masaki, et al.
Published: (2025)
The limit theorem with respect to the matrices on non-backtracking paths of a graph
by: Hasegawa, Takehiro, et al.
Published: (2020)
by: Hasegawa, Takehiro, et al.
Published: (2020)
A note on vertex-critical induced subgraphs of shift graphs
by: Kaiser, Tomáš, et al.
Published: (2026)
by: Kaiser, Tomáš, et al.
Published: (2026)
Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)
by: Kashima, Masaki, et al.
Published: (2026)
Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
by: Kashima, Masaki, et al.
Published: (2025)
by: Kashima, Masaki, et al.
Published: (2025)
Pseudo-Gorenstein$^{*}$ Graphs
by: Hibi, Takayuki, et al.
Published: (2026)
by: Hibi, Takayuki, et al.
Published: (2026)
The Number of Spanning Trees for The Generalized Cones of $K_n$, The Generalized Half Cones of $K_{m,n}$ and Some Family of Modified $K_{m,n}$
by: Cinkir, Zubeyir
Published: (2024)
by: Cinkir, Zubeyir
Published: (2024)
Katz similarity index comparisons
by: Evans, Emily J., et al.
Published: (2025)
by: Evans, Emily J., et al.
Published: (2025)
Small hitting sets for longest paths and cycles
by: Norin, Sergey, et al.
Published: (2025)
by: Norin, Sergey, et al.
Published: (2025)
Stacking and clearing in graph pebbling
by: Csernák, Tamás, et al.
Published: (2026)
by: Csernák, Tamás, et al.
Published: (2026)
On main eigenvalues of certain graphs
by: Abreu, Nair, et al.
Published: (2016)
by: Abreu, Nair, et al.
Published: (2016)
Cycle-factors in oriented graphs
by: Wang, Zhilan, et al.
Published: (2024)
by: Wang, Zhilan, et al.
Published: (2024)
On walk domination: Between different types of walks and $m_3$-path
by: Chen, Hangdi, et al.
Published: (2025)
by: Chen, Hangdi, et al.
Published: (2025)
Similar Items
-
The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025) -
Invitation to the subpath number
by: Knor, Martin, et al.
Published: (2025) -
Fault tolerance of metric basis can be expensive
by: Knor, Martin, et al.
Published: (2024) -
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
by: Sedlar, Jelena, et al.
Published: (2023) -
Proper Z4 x Z2-colorings: structural characterization with application to some snarks
by: Sedlar, Jelena, et al.
Published: (2024)