A general class of invulnerable graphs

DOI10.1002/NET.3230020306MaRDI QIDQ5659590zbMATH OpenOpenAlexFDO

Authors

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

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

Cites work

• Graphs with circulant adjacency matrices
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)

Cited in

(10)

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

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

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