Toughness of Kronecker product of graphs.

zbMATH Open1413.05289MaRDI QIDQ2829035FDOQ2829035

Authors: Raxida Guji, Tursun Ali 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• A note on the toughness and edge-toughness of Kronecker product of graphs
• The toughness of Kneser graphs
• scientific article; zbMATH DE number 2188362
• Vertex-neighbor-toughness of the Cartesian products of paths and cycles.
• scientific article; zbMATH DE number 165068
• Toughness and \([a,b]\)-factors in graphs.
• On the toughness of graphs
• On the Toughness of a Graph
• scientific article; zbMATH DE number 2187689
• Toughness of graphs and 2-factors with given properties.

zbMATH Keywords

Kronecker productcomplete graphtoughness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (4)

• Edge-toughness of some regular graphs
• A note on the toughness and edge-toughness of Kronecker product of graphs
• The toughness of Kneser graphs
• Toughness of the corona of two graphs

This page was built for publication: Toughness of Kronecker product of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829035)