Image de couverture de livre

Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eidi, Marzieh, Otter, Nina
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics Social and Information Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A comprehensive generalization of the Friendship Paradox to weights and attributes
par: Evtushenko, Anna, et autres
Publié: (2024)

Counting simplicial pairs in hypergraphs
par: Barrett, Jordan, et autres
Publié: (2024)

Coalgebraic analysis of social systems
par: Motamed, Nima, et autres
Publié: (2026)

Introduction to graph theory and basic algorithms
par: Tuzhilin, Mikhail, et autres
Publié: (2023)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs
par: Sambaturu, Prathyush, et autres
Publié: (2025)

Ellipsoidal embeddings of graphs
par: Fanuel, Michaël, et autres
Publié: (2024)

Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
par: Dayan, Benjamin, et autres
Publié: (2024)

Playing Sudoku on random 3-regular graphs
par: Dippel, Jack, et autres
Publié: (2025)

Reconstructing graphs and their connectivity using graphlets
par: Hartman, David, et autres
Publié: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
par: Hertz, Alain, et autres
Publié: (2021)

On rigid regular graphs and a problem of Babai and Pultr
par: Knauer, Kolja, et autres
Publié: (2025)

On the existence of factors intersecting sets of cycles in regular graphs
par: Goedgebeur, Jan, et autres
Publié: (2024)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
par: Hertz, Alain, et autres
Publié: (2021)

New small regular graphs of given girth: the cage problem and beyond
par: Exoo, Geoffrey, et autres
Publié: (2025)

Causal Models for Growing Networks
par: Bravo-Hermsdorff, Gecia, et autres
Publié: (2025)

CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs
par: Chervov, A., et autres
Publié: (2025)

Coprime networks of the composite numbers: pseudo-randomness and synchronizability
par: Miraj, Md Rahil, et autres
Publié: (2024)

Canonical labelling of random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2026)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
par: Beaudou, Laurent, et autres
Publié: (2025)

On graphs with a simple structure of maximal cliques
par: Gollin, J. Pascal, et autres
Publié: (2025)

Sample compression schemes for balls in structurally sparse graphs
par: Bourneuf, Romain, et autres
Publié: (2026)

Emergence of network communities driven by local rules
par: Vazquez, Alexei
Publié: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
par: Kurapov, Sergey, et autres
Publié: (2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
par: Foucaud, Florent, et autres
Publié: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
par: Kurapov, Sergey, et autres
Publié: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
par: Kurapov, Sergey, et autres
Publié: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
par: Claus, Quentin, et autres
Publié: (2026)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
par: Kurapov, Sergey, et autres
Publié: (2024)

On universal graphs for trees and treewidth $k$ graphs
par: Kaul, Neel, et autres
Publié: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
par: Mütze, Torsten, et autres
Publié: (2024)

Computational complexity of covering regular trees
par: Bok, Jan, et autres
Publié: (2025)

Determining a graph from its reconfiguration graph
par: Berthe, Gaétan, et autres
Publié: (2025)

Vertex-critical graphs in co-gem-free graphs
par: Beaton, Iain, et autres
Publié: (2024)

Effects of graph operations on star pairwise compatibility graphs
par: Monti, Angelo, et autres
Publié: (2024)

Optimal Erasure Codes and Codes on Graphs
par: Chen, Yeyuan, et autres
Publié: (2025)

The Labeled Coupon Collector Problem
par: Tan, Andrew, et autres
Publié: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
par: Yu, Lei
Publié: (2025)

On the Codebook Design for NOMA Schemes from Bent Functions
par: Li, Chunlei, et autres
Publié: (2025)

Universal cycle constructions for k-subsets and k-multisets
par: Campbell, Colin, et autres
Publié: (2026)