An algorithm to construct k-regular k-connected graphs with the maximum k-diameter
From MaRDI portal
(Redirected from Publication:1396656)
An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter
An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter
Lua error in package.lua at line 80: module 'SPARQL' not found.
Lua error in package.lua at line 80: module 'SPARQL' not found.
Recommendations
Lua error in package.lua at line 80: module 'SPARQL' not found.
Cited in
Lua error in package.lua at line 80: module 'SPARQL' not found.
This page was built for publication: An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396656)
<div class="DeepChat" data-config='{
"history": [
{"text": "Hi there. I am the MaRDI chat bot.", "role": "ai"},
{"text": "You can ask me questions about this or click on an example.", "role": "ai"}
],
"pagename": "An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter",
"namespace": "",
"pagetitle": Lua error in package.lua at line 80: module 'SPARQL' not found.,
"stream": false,
"demo": false
}'>