APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
From MaRDI portal
Publication:5863397
DOI10.11568/KJM.2012.20.2.239OpenAlexW4244337906MaRDI QIDQ5863397FDOQ5863397
Authors: Byeong Moon Kim, Byung Chul Song, Woonjae Hwang
Publication date: 11 March 2022
Published in: Korean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11568/kjm.2012.20.2.239
Recommendations
Cites Work
- Diameters of Polyhedral Graphs
- Title not available (Why is that?)
- The diameter of directed graphs
- Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
- Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs
- Minimum graphs of specified diameter, connectivity and valence. II
- On the diameter of a graph
- The minimum order of n-connected n-regular graphs with specified diameters
- The minimum-order three-connected cubic graphs with specified diameters
- Longest Simple Paths in Polyhedral Graphs
Cited In (2)
This page was built for publication: APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863397)