Results 141 to 150 of about 138,741 (178)
An innovative inspection of a cantilever beam exposed to principal parametric excitation. [PDF]
Sci RepMoatimid GM, Amer TS, Mohamed MAA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Computing Surveys, 1995
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and their history. Several classical graph theory results concerning cubic graphs are explained. Graph theory problems whose solutions on cubic graphs are particularly important or interesting are presented both from the sequential and parallel point of view.
GREENLAW R., PETRESCHI, Rossella
openaire +4 more sources
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and their history. Several classical graph theory results concerning cubic graphs are explained. Graph theory problems whose solutions on cubic graphs are particularly important or interesting are presented both from the sequential and parallel point of view.
GREENLAW R., PETRESCHI, Rossella
openaire +4 more sources
Journal of the London Mathematical Society, 1986
This paper completes the classification of cubic distance-regular graphs. We define the profile and period of certain cycles in such a graph, and obtain congruence conditions on the periods that help determine the feasible intersection arrays. It turns out that there are just 13 possible cases and in each case the array is realised by a unique graph.
Biggs, N.L. +2 more
openaire +2 more sources
This paper completes the classification of cubic distance-regular graphs. We define the profile and period of certain cycles in such a graph, and obtain congruence conditions on the periods that help determine the feasible intersection arrays. It turns out that there are just 13 possible cases and in each case the array is realised by a unique graph.
Biggs, N.L. +2 more
openaire +2 more sources
2021
38. Bipartite cubic graphs. — A particular case of regular graphs is that of cubic graphs (§7) which serves as a foundation for the statement of the four color problem.
Martin Charles Golumbic +1 more
openaire +1 more source
38. Bipartite cubic graphs. — A particular case of regular graphs is that of cubic graphs (§7) which serves as a foundation for the statement of the four color problem.
Martin Charles Golumbic +1 more
openaire +1 more source
Excluding Minors in Cubic Graphs
Combinatorics, Probability and Computing, 1996Let P10\e be the graph obtained by deleting an edge from the Petersen graph. We give a decomposition theorem for cubic graphs with no minor isomorphic to P10\e. The decomposition is used to show that graphs in this class are 3-edge-colourable. We also consider an application to a conjecture due to Grötzsch which states that a planar graph is 3-edge ...
Kilakos, K., Shepherd, B.
openaire +2 more sources
Cubic Bridgeless Graphs and Braces
Graphs and Combinatorics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiménez, Andrea +2 more
openaire +2 more sources
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