The symmetric (2k, k)-graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200101)36:1<35::AID-JGT4>3.0.CO;2-J" /><35::AID-JGT4>3.0.CO;2-J 10.1002/1097-0118(200101)36:1<35::AID-JGT4>3.0.CO;2-JzbMath0977.05075OpenAlexW4242698780MaRDI QIDQ2708794

Matthias Kriesell

Publication date: 8 January 2002

Full work available at URL: https://doi.org/10.1002/1097-0118(200101)36:1<35::aid-jgt4>3.0.co;2-j

zbMATH Keywords

atomconnectivitystrongly regularfactoredge-transitivevertex-transitivefragment

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Connectivity (05C40)

Cites Work

• On locally \(k\)-critically \(n\)-connected graphs
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• The connectivity of strongly regular graphs
• Generalizaions of critical connectivity of graphs
• On \(k\)-critical connected line graphs
• On critically h-connected simple graphs
• On k-critical, n-connected graphs
• Fragments in 2-critically \(n\)-connected graphs
• On the existence of \((k,l)\)-critical graphs
• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische Graphen
• Domination-balanced graphs
• Nonseparating cycles inK-Connected graphs
• Die Zusammenhangsstruktur symmetrischer Graphen.
• Maximal matchings in graphs with given minimal and maximal degrees
• An algorithm for the decomposition of graphs into cliques

This page was built for publication: The symmetric (2k, k)-graphs