Cover Image

Oriented diameter of graphs with given domination number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Xiaolin, Chen, Yaojun
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Oriented Ramsey numbers of some sparse graphs
by: Lu, Junying, et al.
Published: (2024)

Oriented diameter of graphs with diameter $4$ and given edge girth
by: Lin, Jifu, et al.
Published: (2025)

Improved bound on the number of edges of diameter-$k$-critical graphs
by: Wang, Xiaolin, et al.
Published: (2024)

New bounds for Ramsey numbers involving graphs with a center
by: Zhang, Yanbo, et al.
Published: (2026)

Size of bipartite graphs with given diameter and connectivity constraints
by: Mafunda, Sonwabile
Published: (2025)

On the oriented diameter of graphs with given minimum degree
by: Cochran, Garner, et al.
Published: (2024)

Ramsey numbers and Gallai--Ramsey numbers of disjoint unions of cherries
by: Zhang, Yanbo, et al.
Published: (2026)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

Oriented trees in digraphs with large girth
by: Lu, Junying, et al.
Published: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Ramsey numbers of sparse graphs versus disjoint books
by: Huang, Ting, et al.
Published: (2025)

Minimal spectral radius of graphs with given matching number
by: Liu, Jiaqi, et al.
Published: (2026)

The Turán number of the triangular pyramid of 4-layers
by: Chen, Hangdi, et al.
Published: (2026)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

New results on proper orientation number of graphs
by: Wang, Laochao Wang Xiaolin, et al.
Published: (2026)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

Bounds for the Grundy chromatic number of graphs in terms of domination number
by: Khaleghi, Abbas, et al.
Published: (2022)

Connected graphs minimizing the spectral radius for given order and dissociation number
by: Huang, Zejun, et al.
Published: (2026)

On the disjunctive domination numbers of the torus grid graphs
by: Qiao, Zhi, et al.
Published: (2026)

On independent domination and packing numbers of subcubic graphs
by: Bai, Xuqing, et al.
Published: (2024)

New results on the Wiener index of trees with a given diameter
by: Borovićanin, Bojana, et al.
Published: (2025)

Graphs with a given conditional diameter that maximize the Wiener index
by: An, Junfeng, et al.
Published: (2024)

Cycles and paths through specified vertices in graphs with a given clique number
by: Li, Chengli, et al.
Published: (2025)

Extremal number of cliques of given orders in graphs with a forbidden clique minor
by: Shi, Ruilin, et al.
Published: (2024)

Oriented diameter of the complete tripartite graph (III)
by: Liu, Jing, et al.
Published: (2025)

Oriented diameter of the complete tripartite graph (II)
by: Liu, Jing, et al.
Published: (2025)

The diameter and dominating sets of the difference graph of a nilpotent group
by: Ma, Xuanlong, et al.
Published: (2026)

Extremal regular graphs of given chromatic number
by: Rubio-Montiel, Christian
Published: (2019)

On the second largest adjacency eigenvalue of trees with given diameter
by: Kumar, Hitesh, et al.
Published: (2024)

Trichotomy and $tK_m$-goodness of sparse graphs
by: Zhang, Yanbo, et al.
Published: (2025)

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
by: Wang, Yichen, et al.
Published: (2026)

Table of large graphs with given degree and diameter
by: Comellas, Francesc
Published: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

Lower bounds for the total (distance) $k$-domination number of a graph
by: Davila, Randy
Published: (2024)

The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
by: Abiad, Aida, et al.
Published: (2023)