Indecomposable switching graph with the number of vertices N_ 2 N- 9 4 N

DOI10.1007/BF02304765zbMATH Open0847.05090MaRDI QIDQ1916629FDOQ1916629

Authors: M. G. Adigeev 

Publication date: 9 July 1996

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

algorithmswitching graphsindecomposable switching graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Indecomposable switching graph with the number of vertices \(N\log_ 2 N- {9\over 4} N\)

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