The Small Deflection Of A Normally Loaded Square Plate, Elastically Supported Along It's Edges
H. W. Parsons, D. M. A. Leggett (1958)
Publications de l'Institut Mathématique
Similarity:
H. W. Parsons, D. M. A. Leggett (1958)
Publications de l'Institut Mathématique
Similarity:
Liecheng Sun, Issam E. Harik (2015)
Curved and Layered Structures
Similarity:
Analytical Strip Method is presented for the analysis of the bending-extension coupling problem of stiffened and continuous antisymmetric thin laminates. A system of three equations of equilibrium, governing the general response of antisymmetric laminates, is reduced to a single eighth-order partial differential equation (PDE) in terms of a displacement function. The PDE is then solved in a single series form to determine the displacement response of antisymmetric cross-ply and angle-ply...
Visentin, Terry I., Wieler, Susana W. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Juan José Montellano-Ballesteros (2006)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V(G), E(G)) be a connected multigraph and let h(G) be the minimum integer k such that for every edge-colouring of G, using exactly k colours, there is at least one edge-cut of G all of whose edges receive different colours. In this note it is proved that if G has at least 2 vertices and has no bridges, then h(G) = |E(G)| -|V(G)| + 2.
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1987)
Czechoslovak Mathematical Journal
Similarity:
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
The edge-domatic number of a graph is the maximum number of classes of a partition of its edge set into dominating sets. This number is studied for cacti, i.e. graphs in which each edge belongs to at most one circuit.
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: