Minimum arc-cuts of normally regular digraphs and Deza digraphs (Q2138973): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2022.112879 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2022.112879 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220930268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts of distance-regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Theory and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-transitive and distance-regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed graph version of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deza graphs: A generalization of strongly regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normally regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deza digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432945 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2022.112879 / rank
 
Normal rank

Latest revision as of 05:17, 17 December 2024

scientific article
Language Label Description Also known as
English
Minimum arc-cuts of normally regular digraphs and Deza digraphs
scientific article

    Statements

    Minimum arc-cuts of normally regular digraphs and Deza digraphs (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2022
    0 references
    By a normally regular digraph with parameters $(n, k, \lambda, \mu)$, also denoted by $\text{NRD}(n, k, \lambda, \mu)$, we mean a $k$-regular digraph on $n$ vertices such that (i) any two non-adjacent vertices have exactly $\mu$ common out-neighbours; (ii) any two vertices $x$, $y$ such that either $x\to y$ or $x\leftarrow y$ have exactly $\lambda$ common out-neighbours; (iii) any two vertices $x$, $y$ such that $x\leftrightarrow y$ have exactly $2\lambda-\mu$ common out-neighbours. By a Deza graph with parameters $(n,k, b, c)$ we mean a $k$-regular graph on $n$ vertices such that any two distinct vertices have $b$ or $c$ common neighbours. In this paper, the authors establish that a normally regular graph $\text{NRD}(n, k, \lambda, \mu)$ has $k$ as arc-connectivity. To achieve this they obtain two technical lemmas. The paper forms an interesting read and will serve as a stimulating source for further research in this direction.
    0 references
    regular digraphs
    0 references
    arc-connectivity
    0 references
    arc-cut
    0 references

    Identifiers