Path-connectivity of lexicographic product graphs (Q2804863): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/00207160.2014.987762 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977150107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Grid Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees on the star network with applications to fault tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree packing problem in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: A cutting plane algorithm and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pendant tree-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-connectivity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\ell\)-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree packing number of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of path properties for graphs / rank
 
Normal rank

Latest revision as of 22:57, 11 July 2024

scientific article
Language Label Description Also known as
English
Path-connectivity of lexicographic product graphs
scientific article

    Statements

    Path-connectivity of lexicographic product graphs (English)
    0 references
    0 references
    6 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connectivity
    0 references
    internally disjoint paths connecting \(S\)
    0 references
    packing
    0 references
    path-connectivity
    0 references
    lexicographic product
    0 references
    0 references