Globally bi-3*-connected graphs (Q1025446)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Globally bi-3*-connected graphs	scientific article

Statements

scholarly article

0 references

Globally bi-3*-connected graphs (English)

0 references

0 references

0 references

0 references

Discrete Mathematics

0 references

publication date

19 June 2009

0 references

zbMATH Keywords

connectivity

0 references

Menger's theorem

0 references

Hamiltonian

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2008.03.015

0 references

0 references

0 references

Edge fault tolerance in graphs

0 references

THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS

0 references

Cubic planar Hamiltonian graphs of various types

0 references

Christmas tree: a versatile 1-fault-tolerant design for token rings

0 references

Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs

0 references

Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs

0 references

The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks

0 references

On the spanning connectivity of graphs

0 references

On the spanning connectivity and spanning laceability of hypercube-like networks

0 references

Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

0 references

The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus

0 references

Optimal 1-Hamiltonian graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.disc.2008.03.015

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1025446

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1025446&oldid=35113314"