Hamilton-connectivity of interconnection networks modeled by a product of graphs
From MaRDI portal
Publication:2690609
Recommendations
- Reliability of interconnection networks modeled by a product of graphs
- On edge-connectivity and super edge-connectivity of interconnection networks modeled by product graphs
- Fault-Hamiltonicity of product graph of path and cycle
- Hamilton-connected properties in Cartesian product
- Panconnectivity for interconnection networks with faulty elements
Cites work
- (, )-connectivity index of graphs
- A generalization of a result of Bauer and Schmeichel
- A note on the independent domination number versus the domination number in bipartite graphs.
- A sufficient condition for the existence of a k-factor excluding a given r-factor
- Graph theory with applications
- scientific article; zbMATH DE number 19172 (Why is no real title available?)
- scientific article; zbMATH DE number 822747 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- Large graphs with given degree and diameter. II
- Odd mean labeling for two star graph
- On extremal multiplicative Zagreb indices of trees with given domination number
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- Some new standard graphs labeled by 3-total edge product cordial labeling
- The domination complexity and related extremal values of large 3D torus
Cited in
(4)
This page was built for publication: Hamilton-connectivity of interconnection networks modeled by a product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2690609)