Trees and graphs: congestion, polynomials and reconstruction

Trees and graphs: congestion, polynomials and reconstruction

<p>Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained. We compute the parameter for several families of graphs. In particular, by partitioning a hypercube into pieces with almost optimal edge-bou...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awdur:	Law, H
Awduron Eraill:	Scott, A
Fformat:	Traethawd Ymchwil
Iaith:	English
Cyhoeddwyd:	2011
Pynciau:	Combinatorics

Eitemau Tebyg

The complexity of graph polynomials
gan: Noble, S, et al.
Cyhoeddwyd: (1997)

On Weakly Distinguishing Graph Polynomials
gan: Johann A. Makowsky, et al.
Cyhoeddwyd: (2019-04-01)

Graph reconstruction and structure
gan: Tan, J
Cyhoeddwyd: (2023)

Cycles in edge-coloured graphs and subgraphs of random graphs
gan: White, M
Cyhoeddwyd: (2011)

Zero-patterns of polynomials and Newton polytopes
gan: Lauder, A
Cyhoeddwyd: (2003)

Connectivity and related properties for graph classes
gan: Weller, K, et al.
Cyhoeddwyd: (2014)

Uniform random planar graphs with degree constraints
gan: Dowden, C
Cyhoeddwyd: (2008)

Several Roman domination graph invariants on Kneser graphs
gan: Tatjana Zec, et al.
Cyhoeddwyd: (2023-05-01)

The Neighborhood Polynomial of Chordal Graphs
gan: Helena Bergold, et al.
Cyhoeddwyd: (2022-05-01)

Colourings of random graphs
gan: Heckel, A
Cyhoeddwyd: (2016)

Some results on counting roots of polynomials and the Sylvester resultant.
gan: Michael Monagan, et al.
Cyhoeddwyd: (2020-04-01)

Constant Congestion Brambles
gan: Meike Hatzel, et al.
Cyhoeddwyd: (2022-03-01)

On the Connectivity of Token Graphs of Trees
gan: Ruy Fabila-Monroy, et al.
Cyhoeddwyd: (2022-03-01)

Domination in Kn\"odel Graphs
gan: Jesse Racicot, et al.
Cyhoeddwyd: (2022-05-01)

Antifactors of regular bipartite graphs
gan: Hongliang Lu, et al.
Cyhoeddwyd: (2020-06-01)

Group twin coloring of graphs
gan: Sylwia Cichacz, et al.
Cyhoeddwyd: (2018-06-01)

On the centroid of increasing trees
gan: Kevin Durant, et al.
Cyhoeddwyd: (2019-08-01)

Semitotal domination in trees
gan: Zhuang Wei, et al.
Cyhoeddwyd: (2018-09-01)

Improved product structure for graphs on surfaces
gan: Marc Distel, et al.
Cyhoeddwyd: (2022-10-01)

On the genera of polyhedral embeddings of cubic graph
gan: Gunnar Brinkmann, et al.
Cyhoeddwyd: (2021-11-01)

Packing chromatic vertex-critical graphs
gan: Sandi Klavžar, et al.
Cyhoeddwyd: (2019-02-01)

Some results on the palette index of graphs
gan: C. J. Casselgren, et al.
Cyhoeddwyd: (2019-05-01)

Packing coloring of generalized Sierpinski graphs
gan: Danilo Korze, et al.
Cyhoeddwyd: (2019-02-01)

Refined Enumeration of Corners in Tree-like Tableaux
gan: Sherry H. F. Yan, et al.
Cyhoeddwyd: (2017-09-01)

List-antimagic labeling of vertex-weighted graphs
gan: Zhanar Berikkyzy, et al.
Cyhoeddwyd: (2021-12-01)

The Chromatic Number of the Disjointness Graph of the Double Chain
gan: Ruy Fabila-Monroy, et al.
Cyhoeddwyd: (2020-03-01)

Enumeration of Corners in Tree-like Tableaux
gan: Alice L. L. Gao, et al.
Cyhoeddwyd: (2016-12-01)

Maker-Breaker total domination game on cubic graphs
gan: Jovana Forcan, et al.
Cyhoeddwyd: (2022-06-01)

Binding Number, Toughness and General Matching Extendability in Graphs
gan: Hongliang Lu, et al.
Cyhoeddwyd: (2019-01-01)

A note on tight cuts in matching-covered graphs
gan: Xiao Zhao, et al.
Cyhoeddwyd: (2021-06-01)

Associated Permutations of Complete Non-Ambiguous Trees
gan: Daniel Chen, et al.
Cyhoeddwyd: (2024-04-01)

Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
gan: Peixue Zhao, et al.
Cyhoeddwyd: (2023-05-01)

Solving Two Conjectures regarding Codes for Location in Circulant Graphs
gan: Ville Junnila, et al.
Cyhoeddwyd: (2019-01-01)

Tight upper bound on the maximum anti-forcing numbers of graphs
gan: Lingjuan Shi, et al.
Cyhoeddwyd: (2017-10-01)

Oriented Flip Graphs and Noncrossing Tree Partitions
gan: Alexander Garver, et al.
Cyhoeddwyd: (2020-04-01)

The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
gan: Richard C Brewster, et al.
Cyhoeddwyd: (2022-11-01)

On neighbour sum-distinguishing $\{0,1\}$-edge-weightings of bipartite graphs
gan: Kasper Szabo Lyngsie
Cyhoeddwyd: (2018-06-01)

The maximum number of $P_\ell$ copies in $P_k$-free graphs
gan: Ervin Győri, et al.
Cyhoeddwyd: (2019-07-01)

Proving exact values for the $2$-limited broadcast domination number on grid graphs
gan: Aaron Slobodin, et al.
Cyhoeddwyd: (2023-11-01)

Maker-Breaker domination game on trees when Staller wins
gan: Csilla Bujtás, et al.
Cyhoeddwyd: (2023-09-01)