A Multi-level Finite Element Nodal Ordering using Algebraic Graph Theory

2009 ◽  
Author(s):  
A. Kaveh ◽  
H.A. Rahimi Bondarabady
Keyword(s):  
Finite Element ◽  
Graph Theory ◽  
Algebraic Graph Theory ◽  
Multi Level

AN APPLICATION OF GRAPH THEORY IN PLOTTING FINITE ELEMENT MESH

CAD84 ◽  
1984 ◽  
pp. 298-306
Author(s):  
R. SANDANADURAI ◽  
N. NACKEERAN
Keyword(s):  
Finite Element ◽  
Graph Theory ◽  
Finite Element Mesh ◽  
Element Mesh

scholarly journals Order divisor graphs of finite groups

2018 ◽  
Vol 26 (3) ◽  
pp. 29-40
Author(s):  
S. U. Rehman ◽  
A. Q. Baig ◽  
M. Imran ◽  
Z. U. Khan
Keyword(s):  
Graph Theory ◽  
Finite Groups ◽  
Algebraic Graph Theory ◽  
Vertex Set ◽  
Productive Area

AbstractThe interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having di erent orders are adjacent provided that o(a) divides o(b) or o(b) divides o(a).

scholarly journals A Positive Combinatorial Formula for the Complexity of the $q$-Analog of the $n$-Cube

10.37236/2389 ◽  
2012 ◽  
Vol 19 (2) ◽  
Author(s):  
Murali Krishna Srinivasan
Keyword(s):  
Graph Theory ◽  
Explicit Formula ◽  
Classical Result ◽  
Spanning Trees ◽  
Combinatorial Formula ◽  
Algebraic Graph Theory ◽  
The Matrix ◽  
Number Of Spanning Trees

The number of spanning trees of a graph $G$ is called the complexity of $G$. A classical result in algebraic graph theory explicitly diagonalizes the Laplacian of the $n$-cube $C(n)$  and yields, using the Matrix-Tree theorem, an explicit formula for $c(C(n))$. In this paper we explicitly block diagonalize the Laplacian of the $q$-analog $C_q(n)$ of $C(n)$ and use this, along with the Matrix-Tree theorem, to give a positive combinatorial formula for $c(C_q(n))$. We also explain how setting $q=1$ in the formula for $c(C_q(n))$ recovers the formula for $c(C(n))$.

Thermal Modeling in Metal Additive Manufacturing Using Graph Theory

2019 ◽  
Vol 141 (7) ◽  
Author(s):  
M. Reza Yavari ◽  
Kevin D. Cole ◽  
Prahalada Rao
Keyword(s):  
Finite Element ◽  
Graph Theory ◽  
Additive Manufacturing ◽  
Temperature Distribution ◽  
Process Parameters ◽  
Green’S Functions ◽  
Theory Approach ◽  
Finite Element Analyses ◽  
Part Quality ◽  
Am Processes

The goal of this work is to predict the effect of part geometry and process parameters on the instantaneous spatiotemporal distribution of temperature, also called the thermal field or temperature history, in metal parts as they are being built layer-by-layer using additive manufacturing (AM) processes. In pursuit of this goal, the objective of this work is to develop and verify a graph theory-based approach for predicting the temperature distribution in metal AM parts. This objective is consequential to overcome the current poor process consistency and part quality in AM. One of the main reasons for poor part quality in metal AM processes is ascribed to the nature of temperature distribution in the part. For instance, steep thermal gradients created in the part during printing leads to defects, such as warping and thermal stress-induced cracking. Existing nonproprietary approaches to predict the temperature distribution in AM parts predominantly use mesh-based finite element analyses that are computationally tortuous—the simulation of a few layers typically requires several hours, if not days. Hence, to alleviate these challenges in metal AM processes, there is a need for efficient computational models to predict the temperature distribution, and thereby guide part design and selection of process parameters instead of expensive empirical testing. Compared with finite element analyses techniques, the proposed mesh-free graph theory-based approach facilitates prediction of the temperature distribution within a few minutes on a desktop computer. To explore these assertions, we conducted the following two studies: (1) comparing the heat diffusion trends predicted using the graph theory approach with finite element analysis, and analytical heat transfer calculations based on Green’s functions for an elementary cuboid geometry which is subjected to an impulse heat input in a certain part of its volume and (2) simulating the laser powder bed fusion metal AM of three-part geometries with (a) Goldak’s moving heat source finite element method, (b) the proposed graph theory approach, and (c) further comparing the thermal trends predicted from the last two approaches with a commercial solution. From the first study, we report that the thermal trends approximated by the graph theory approach are found to be accurate within 5% of the Green’s functions-based analytical solution (in terms of the symmetric mean absolute percentage error). Results from the second study show that the thermal trends predicted for the AM parts using graph theory approach agree with finite element analyses, and the computational time for predicting the temperature distribution was significantly reduced with graph theory. For instance, for one of the AM part geometries studied, the temperature trends were predicted in less than 18 min within 10% error using the graph theory approach compared with over 180 min with finite element analyses. Although this paper is restricted to theoretical development and verification of the graph theory approach, our forthcoming research will focus on experimental validation through in-process thermal measurements.

scholarly journals Computers and discovery in algebraic graph theory

2002 ◽  
Vol 356 (1-3) ◽  
pp. 211-230 ◽  
Author(s):  
Pierre Hansen ◽  
Hadrien Mélot
Keyword(s):  
Graph Theory ◽  
Algebraic Graph Theory
Sign in / Sign up

Export Citation Format

Share Document