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 条
[21]   Energy of Graphs, Matroids and Numbers [J].
Alikhani, Saeid ;
Iranmanesh, Mohammad A. .
IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2010, 5 (02) :55-60
[22]   INFINITE GRAPHS AND BICIRCULAR MATROIDS [J].
MATTHEWS, LR ;
OXLEY, JG .
DISCRETE MATHEMATICS, 1977, 19 (01) :61-65
[23]   Diverse Collections in Matroids and Graphs [J].
Fomin, Fedor, V ;
Golovach, Petr A. ;
Panolan, Fahad ;
Philip, Geevarghese ;
Saurabh, Saket .
38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
[24]   ELEMENTARY DIVISORS OF GRAPHS AND MATROIDS [J].
VINCE, A .
EUROPEAN JOURNAL OF COMBINATORICS, 1991, 12 (05) :445-453
[25]   Visibility graphs and oriented matroids [J].
Abello, J ;
Kumar, K .
DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 28 (04) :449-465
[26]   Cycles in Circuit Graphs of Matroids [J].
Ping Li ;
Guizhen Liu .
Graphs and Combinatorics, 2007, 23 :425-431
[27]   ON PAVING MATROIDS AND A GENERALIZATION OF MDS CODES [J].
RAJPAL, S .
DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) :343-347
[28]   Paths in circuit graphs of matroids [J].
Liu, Guizhen ;
Li, Ping .
THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) :258-263
[29]   Contractible elements in graphs and matroids [J].
Wu, HD .
COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (04) :457-465
[30]   Matroids of Gain Signed Graphs [J].
Anderson, Laura ;
Su, Ting ;
Zaslavsky, Thomas .
DISCRETE & COMPUTATIONAL GEOMETRY, 2023, 72 (2) :503-549