The theories of graphs and matroids as a generalization for analysis of structures

被引:0
作者
Shai, OG [1 ]
机构
[1] Tel Aviv Univ, Dept Solid Mech Mat & Struct, IL-69978 Tel Aviv, Israel
来源
COMPUTER TECHNIQUES FOR CIVIL AND STRUCTURAL ENGINEERING | 1999年
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a general approach for structural analysis, based on graph and matroid theories, where the implementation to trusses is reported in this paper. Two general methods from graph network theory are introduced with their mathematical proofs, the resistance circuit and conductance cutset methods. These are proved to be dual. In addition, it is shown that when the conductance cutset method is applied to analysis of trusses, a method similar to the stiffness method is derived. After an introduction to matroids, it is shown that by using the duality property from matroid theory, the displacement and force methods are dual. The results reported in the paper are not only intellectually interesting, but have practical applications, some of which are mentioned in the paper. These include developing a new type of reasoning by analogy in Artificial Intelligence, based on the connections and properties of the graph and matroid representations. and a new direction for engineering education in which the students are first taught graph representations and then structural mechanics. This approach enables the students to understand structural mechanics in a more general prospective.
引用
收藏
页码:15 / 26
页数:12
相关论文
共 50 条
[31]   A survey on flows in graphs and matroids [J].
Guenin, Bertrand .
DISCRETE APPLIED MATHEMATICS, 2016, 209 :122-132
[32]   GRAPHS MATROIDS AND GEOMETRIC LATTICES [J].
SACHS, D .
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (01) :98-&
[33]   Matroids of Gain Signed Graphs [J].
Anderson, Laura ;
Su, Ting ;
Zaslavsky, Thomas .
DISCRETE & COMPUTATIONAL GEOMETRY, 2023, 72 (2) :503-549
[34]   Graded sparse graphs and matroids [J].
Lee, Audrey ;
Streinu, Ileana ;
Theran, Louis .
JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (11) :1671-1679
[35]   ANTIPODAL GRAPHS AND ORIENTED MATROIDS [J].
FUKUDA, K ;
HANDA, K .
DISCRETE MATHEMATICS, 1993, 111 (1-3) :245-256
[36]   EQUIVALENT FACTOR MATROIDS OF GRAPHS [J].
WAGNER, DK .
COMBINATORICA, 1988, 8 (04) :373-377
[37]   The branchwidth of graphs and their cycle matroids [J].
Hicks, Illya V. ;
McMurray, Nolan B., Jr. .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (05) :681-692
[38]   On decidability of MSO theories of representable matroids [J].
Hlineny, P ;
Seese, D .
PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2004, 3162 :96-107
[39]   On a Generalization of Symmetric Edge Polytopes to Regular Matroids [J].
D'Ali, Alessio ;
Juhnke-Kubitzke, Martina ;
Koch, Melissa .
INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2024, 2024 (14) :10844-10864
[40]   The edge connectivity of circuit graphs of matroids [J].
Li, Ping ;
Liu, Guizhen .
COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 :440-+