The path-pairability number of product of stars (Q2312071): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.2114 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808296941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks communicating for each pairing of terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-regular path pairable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on terminal-pairability in complete grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for graphs to be weakly \(k\)-linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path-pairability of the finite grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path-pairability in the Cartesian product of graphs / rank
 
Normal rank

Latest revision as of 20:03, 19 July 2024

scientific article
Language Label Description Also known as
English
The path-pairability number of product of stars
scientific article

    Statements

    The path-pairability number of product of stars (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    path-pairability
    0 references
    weak linkage
    0 references
    Cartesian product
    0 references
    star-like network
    0 references
    telecommunications network
    0 references
    0 references