Cover Image

A Generalization of the Graham-Pollak Tree Theorem to Even-Order Steiner Distance

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cooper, Joshua, Tauscheck, Gabrielle
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C12 (Primary) 05C50, 15A69 (Secondary) G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Determinants of Steiner Distance Hypermatrices
by: Cooper, Joshua, et al.
Published: (2025)

Note on the spectra of Steiner distance hypermatrices
by: Cooper, Joshua, et al.
Published: (2024)

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Polynomial Reconstruction Problem for Hypergraphs
by: Cooper, Joshua, et al.
Published: (2023)

On 1-Konig-Egervary Graphs
by: Levit, Vadim E., et al.
Published: (2023)

Characteristic Polynomials and Hypergraph Generating Functions via Heaps of Pieces
by: Cooper, Joshua, et al.
Published: (2024)

On Some Bi-Cayley Graphs over Cyclic Groups of Order $p^2 q^2$ and Related Extensions
by: Atmaja, Iqbal, et al.
Published: (2026)

On the distance signless Laplacian spectral radius, fractional matching and factors of graphs
by: Zhang, Z. H., et al.
Published: (2025)

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property
by: Levit, Vadim E., et al.
Published: (2024)

On corona of Konig-Egervary graphs
by: Levit, Vadim E., et al.
Published: (2024)

Almost Bipartite non-König-Egerváry Graphs Revisited
by: Levit, Vadim E., et al.
Published: (2024)

Forbidden paths and cycles in the undirected underlying graph of a 2-quasi best match graph
by: Korchmaros, Annachiara
Published: (2024)

Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)

Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
by: Hoang, Do Trong, et al.
Published: (2024)

The family of all local maximum independent sets is an augmentoid
by: Levit, Vadim E., et al.
Published: (2026)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
by: Lalou, Mohammed, et al.
Published: (2025)

Factors in finite groups and well-covered graphs
by: Kabenyuk, Mikhail
Published: (2026)

Domination on Vertex-weighted Graphs Induce by a Coloring
by: Garrido-Vizuete, María A., et al.
Published: (2025)

Kernels in digraphs with colored vertices
by: Guevara, Mucuy-kak, et al.
Published: (2025)

Metric Dimension of a Direct Product of Three Complete Graphs: The Middle Cone Family
by: Foster-Greenwood, Briana, et al.
Published: (2025)

Closing Trees into Unicyclic Counterexamples
by: Levit, Vadim E., et al.
Published: (2026)

On roots of domination polynomials for friendship and book graphs
by: Rather, Bilal Ahmad
Published: (2026)

Some Extensions of Thomassen's Theorem to Longer Paths
by: Nevin, Joshua
Published: (2022)

An improved bound for 2-distance coloring of planar graphs with girth six
by: Deniz, Zakir
Published: (2022)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

How Trees on Atoms of Subset Algebras Define Minimal Forests and Their Growth
by: Buslov, Vasily
Published: (2025)

Spectral approaches for $d$-improper chromatic number
by: Guo, Krystal, et al.
Published: (2024)

Perfect codes in Cayley graphs of Hajós groups
by: Hafidh, Yusuf, et al.
Published: (2025)

Hypertrees and their host trees: a survey
by: Di Fonzo, Pablo De Caria
Published: (2025)

Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
by: Buslov, Vasily
Published: (2025)

When a forest, narrowed to an atom of subset algebra, turns out to be a tree
by: Buslov, Vasily
Published: (2025)

Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
by: Buslov, Vasily
Published: (2025)

Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
by: Buslov, V. A.
Published: (2025)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

Inertia, Independence and Expanders
by: Tang, Quanyu, et al.
Published: (2025)

On some building blocks of hypergraphs
by: Banerjee, Anirban, et al.
Published: (2022)

A Note on Distance-Fall Colorings
by: Goddard, Wayne, et al.
Published: (2025)

Reconstructing a graph from its Bell colouring graph
by: Hearn, Brian
Published: (2026)

Distant 2-Colored Components on Embeddings Part III: The General Case
by: Nevin, Joshua
Published: (2022)