Results 231 to 240 of about 26,192 (266)
Some of the next articles are maybe not open access.
Det‐extremal cubic bipartite graphs
Journal of Graph Theory, 2003AbstractLet G be a connected k–regular bipartite graph with bipartition V(G) = X ∪ Y and adjacency matrix A. We say G is det‐extremal if per (A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det‐extremal 3‐connected cubic bipartite graphs.
FUNK, Martin +3 more
openaire +2 more sources
Combinatorica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Independent Domination in Cubic Graphs
Journal of Graph Theory, 2015AbstractA set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by , is the minimum cardinality of an independent dominating set.
Dorbec, Paul +3 more
openaire +2 more sources
Counting Claw-Free Cubic Graphs
SIAM Journal on Discrete Mathematics, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Palmer, Edgar M. +2 more
openaire +1 more source
Amalgams of Cubic Bipartite Graphs
Designs, Codes and Cryptography, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
1992
The historical development and the state of the art concerning random subgraphs of the n -cube graph are summarized.
A.V. Kostochka +2 more
openaire +1 more source
The historical development and the state of the art concerning random subgraphs of the n -cube graph are summarized.
A.V. Kostochka +2 more
openaire +1 more source
Deformation twinning in body-centered cubic metals and alloys
Progress in Materials Science, 2023Xiyao Li, Jiangwei Wang
exaly
1990
In this paper we shall study the domatic number, the total domatic number and the connected domatic number of cubic graphs, i. e. regular graphs of degree 3. We consider finite undirected graphs without loops and multiple edges.
openaire +1 more source
In this paper we shall study the domatic number, the total domatic number and the connected domatic number of cubic graphs, i. e. regular graphs of degree 3. We consider finite undirected graphs without loops and multiple edges.
openaire +1 more source
Cubic ice Ic without stacking defects obtained from ice XVII
Nature Materials, 2020Leonardo del Rosso +2 more
exaly