On critical and maximal digraphs

07/24/2018
by   G. Š. Fridman, et al.
0

This paper is devoted to the study of directed graphs with extremal properties relative to certain metric functionals. We characterize up to isomorphism critical digraphs with infinite values of diameter, quasi-diameter, radius and quasi-radius. Moreover, maximal digraphs with finite values of radius and quasi-diameter are studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2018

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates

We introduce notions of certificates allowing to bound eccentricities in...
research
06/06/2022

Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks

This paper studies the round complexity of computing the weighted diamet...
research
12/15/2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

We study the computation of the diameter and radius under the rectilinea...
research
06/16/2022

On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric

The rapid development of DNA storage has brought the deletion and insert...
research
03/02/2021

On the Size of Levenshtein Balls

The rapid development of DNA storage has brought the deletion and insert...
research
08/26/2018

There is no lattice tiling of Z^n by Lee spheres of radius 2 for n≥ 3

We prove the nonexistence of lattice tilings of Z^n by Lee spheres of ra...
research
07/18/2023

Maximal diameter of integral circulant graphs

Integral circulant graphs are proposed as models for quantum spin networ...

Please sign up or login with your details

Forgot password? Click here to reset