Imagen de Portada

Gathering Information about a Graph by Counting Walks from a Single Vertex

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg, Zhukovskii, Maksim
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Canonical labelling of sparse random graphs
por: Verbitsky, Oleg, et al.
Publicado: (2024)

New bounds for the optimal density of covering single-insertion codes via the Turán density
por: Pikhurko, Oleg, et al.
Publicado: (2024)

On the Expressibility of the Reconstructional Color Refinement
por: Arvind, V., et al.
Publicado: (2024)

First order distinguishability of sparse random graphs
por: Hershko, Tal, et al.
Publicado: (2024)

On a Hierarchy of Spectral Invariants for Graphs
por: Arvind, V., et al.
Publicado: (2023)

First order complexity of finite random structures
por: Demin, Danila, et al.
Publicado: (2024)

Vertex Ranking of Degenerate Graphs
por: Iacono, John, et al.
Publicado: (2024)

Making Walks Count: From Silent Circles to Hamiltonian Cycles
por: Alekseyev, Max A., et al.
Publicado: (2016)

Canonical labelling of random regular graphs
por: Isaev, Mikhail, et al.
Publicado: (2026)

Counting the Number of Domatic Partition of a Graph
por: Alikhani, Saeid, et al.
Publicado: (2024)

Making Graphs Irregular through Irregularising Walks
por: Bensmail, Julien, et al.
Publicado: (2025)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
por: Mohan, Amulya, et al.
Publicado: (2024)

Counting Colored Tilings on Grids and Graphs
por: Ramírez, José L., et al.
Publicado: (2024)

Graphs With the Same Edge Count in Each Neighborhood
por: Sheffield, Nathan S., et al.
Publicado: (2025)

Functionality of Random Graphs
por: Sylvester, John, et al.
Publicado: (2024)

Vertex-Based Localization of Turán's Theorem
por: Adak, Rajat, et al.
Publicado: (2025)

Vertex-Based Localization of Generalized Turán Problems
por: Adak, Rajat, et al.
Publicado: (2025)

Vertex-edge domination on subclasses of bipartite graphs
por: Pandey, Arti, et al.
Publicado: (2025)

Vertex-critical graphs in co-gem-free graphs
por: Beaton, Iain, et al.
Publicado: (2024)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
por: Adak, Rajat, et al.
Publicado: (2025)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026)

Menger's Theorem for Temporal Paths (Not Walks)
por: Ibiapina, Allen, et al.
Publicado: (2022)

A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
por: Neuen, Daniel, et al.
Publicado: (2026)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

On a Characterization of Spartan Graphs
por: Misra, Neeldhara, et al.
Publicado: (2025)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
por: Genosar, Dor, et al.
Publicado: (2019)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
por: Das, Sandip, et al.
Publicado: (2023)

Note about the complexity of the acyclic orientation with parity constraint problem
por: Gravier, Sylvain, et al.
Publicado: (2025)

Bond Polytope under Vertex- and Edge-sums
por: Kolman, Petr, et al.
Publicado: (2026)

Partitioning a Planar Graph into two Triangle-Forests
por: Knauer, Kolja, et al.
Publicado: (2024)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
por: Hatzel, Meike, et al.
Publicado: (2024)

Characterization of Circular-arc Graphs: III. Chordal Graphs
por: Cao, Yixin, et al.
Publicado: (2024)

Graph Theory
por: Gilbert, Jesse D.
Publicado: (2011)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
por: Cao, Yixin, et al.
Publicado: (2024)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
por: Frasser, Carlos E.
Publicado: (2026)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
por: Bhyravarapu, Sriram, et al.
Publicado: (2021)

On Threshold Compatibility Graphs
por: Hakim, Sheikh Azizul, et al.
Publicado: (2026)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

Graph Reconstruction with Connectivity Queries
por: Kluk, Kacper, et al.
Publicado: (2024)