A general class of invulnerable graphs

DOI10.1002/net.3230020306zbMath0247.05152OpenAlexW2051808028MaRDI QIDQ5659590

No author found.

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230020306

Mathematics Subject Classification ID

Graph theory (05C99) Other combinatorial set theory (03E05)

Related Items (10)

Embedding trees in recursive circulants ⋮ Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity ⋮ Optimal K-secure graphs ⋮ On the connectivity of Cayley digraphs ⋮ Edge partitions of complete multipartite graphs into equal length circuits ⋮ Disjoint independent dominating sets in graphs ⋮ Analyse und Synthese zuverlässiger Netze ⋮ Recursive circulants and their embeddings among hypercubes ⋮ A family of efficient six-regular circulants representable as a Kronecker product ⋮ Neighbour-connectivity in regular graphs

Cites Work

• Unnamed Item
• Graphs with circulant adjacency matrices

This page was built for publication: A general class of invulnerable graphs