On the construction of combinedk-fault-tolerant Hamiltonian graphs (Q2719848): 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.1002/net.6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1929872735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge fault tolerance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian graphs with minimum number of edges for fault-tolerant topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimumk-hamiltonian graphs, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclosing \(k\) points in the smallest axis parallel rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: MinimumK-hamiltonian graphs / rank
 
Normal rank

Latest revision as of 16:41, 3 June 2024

scientific article
Language Label Description Also known as
English
On the construction of combinedk-fault-tolerant Hamiltonian graphs
scientific article

    Statements

    On the construction of combinedk-fault-tolerant Hamiltonian graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 December 2001
    0 references
    Hamiltonian graph
    0 references
    node expansion
    0 references
    diameter
    0 references

    Identifiers