scholarly journals Mathematical Graph

2020 ◽  
Author(s):  
Keyword(s):  
Mathematical Graph

The 3D graph approach for breakdown voltage calculation in BaTiO3 ceramics

2021 ◽  
pp. 2150103
Author(s):  
Vojislav V. Mitic ◽  
Branislav Randjelovic ◽  
Ivana Ilic ◽  
Srdjan Ribar ◽  
An-Lu Chun ◽  
...  
Keyword(s):  
Graph Theory ◽  
Crystal Structures ◽  
Breakdown Voltage ◽  
Main Idea ◽  
Experimental Results ◽  
Grain Structure ◽  
Mathematical Approach ◽  
Electronic Parameters ◽  
Mathematical Graph

After pioneering attempts for the introduction of graph theory in the field of ceramics and microstructures, where 1D and 2D graphs were used, in this paper we applied 3D graphs for the breakdown voltage calculation in BaTiO3 sample with some predefined constraints. We have described the relations between grains in the sample and established a mathematical approach for the calculation of breakdown voltage using experimental results. As a result, we introduced mapping between the property of sample and grain structure, then between the grain structure and mathematical graph, using various crystal structures. The main idea was to apply 3D graph theory for the distribution of electronic parameters between the neighboring grains. With this study, we successfully confirmed the possibilities for applications of graphs as a tool for the determination of properties even at the intergranular level.

An Approach Toward Emulating Molecular Interaction with a Graph

2006 ◽  
Vol 59 (12) ◽  
pp. 869 ◽  
Author(s):  
Hideaki Suzuki
Keyword(s):  
Random Walk ◽  
Molecular Interaction ◽  
Hard Sphere ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Atomic Clusters ◽  
Experimental Results ◽  
Random Walk Simulation ◽  
Mathematical Graph ◽  
Three Dimensional Space

Network artificial chemistry (NAC) uses a mathematical graph to emulate molecular interaction in a solvent. To emulate molecules' movement in a three-dimensional space, rewiring rules for NAC graphs’ edges must be designed to enable the edges to imitate the relations between molecules or atomic clusters. Our research formulated the ‘network energy’ representing this constraint and rewired the NAC graph to minimize the required energy. Experimental results for the NAC rewiring are compared with a hard-sphere random walk simulation.

Appendix A

2011 ◽  
pp. 244-275
Author(s):  
Goran Trajkovski
Keyword(s):  
Random Graph ◽  
Graph Structure ◽  
Fuzzy Relations ◽  
Algebraic Structures ◽  
Modeling Tool ◽  
Fuzzy Graphs ◽  
Special Case ◽  
Mathematical Graph

The first part of this appendix presents three approaches in defining the fuzzy version (generalization) of the mathematical graph structure: graphs with fuzzy vertices, graphs with fuzzy edges, and graphs with fuzzy vertices and edges. Their advantages and shortcomings are discussed briefly. Fuzzy graphs are observed in the light of fuzzy relations theory, and as a generalization of the notion of random graph. In the second part, we generalize some fuzzy algebraic structures towards not only [0, 1] valued, but lattice, poset, and relational structured valued structures. It is exciting to see how powerful a modeling tool they are, and also to see how classical results continue to hold as but a special case of the new results.

MODELLING OF TWO STAGES DNA SPLICING LANGUAGES ON DE BRUIJN GRAPH

2015 ◽  
Vol 78 (1) ◽  
Author(s):  
Mohammad Hassan Mudaber ◽  
Yuhani Yusof ◽  
Mohd Sham Mohamad ◽  
Aizi Nor Mazila Ramli ◽  
Wen Li Lim
Keyword(s):  
Dna Sequence ◽  
Restriction Enzymes ◽  
De Bruijn Graph ◽  
Dna Molecule ◽  
Interesting Topic ◽  
De Bruijn ◽  
Two Stages ◽  
Mathematical Graph ◽  
Dna Splicing

Finding the sequence of the genome from its compositions as well as a mathematical graph is the most interesting topic in a field of DNA molecular.  Since lack of technology is the big obstacle that biologists are facing to read a long sequence of the genome from beginning up to the end, therefore finding the compositions of the genome having very long sequence and also its description via de Bruijn graph is challenging or even impossible.  In this paper, Yusof-Goode (Y-G) approach is used to generate the DNA splicing languages based on cutting sites of initial strings (one or two cutting sites) and crossing and contexts factors of restriction enzymes. The two short sequences of DNA (8bp) and two restriction enzymes are considered to create a connection between mathematics and DNA molecular.   This relation will be presented as de Bruijn graph so that every edge of the de Bruijn graph gives a k-mer composition of DNA molecule and also each path of the de Bruijn graph gives a DNA sequence and vice-versa. Besides, the persistency and permanency of two stages DNA splicing languages can be predicted using this model.

Graph Theory for Temporal Structure

2018 ◽  
Author(s):  
Jason Yust
Keyword(s):  
Graph Theory ◽  
Spanning Trees ◽  
Temporal Structure ◽  
Temporal Networks ◽  
Graph Theoretic ◽  
Temporal Structures ◽  
Mathematical Graph

This chapter introduces mathematical graph theory and develops graph-theory concepts that are useful for temporal networks. By generating chord progressions from networks, the potential musical and temporal meaning of graph-theory concepts, especially cycles, is emphasized. A number of concepts related to trees are introduced to show hierarchical aspects of temporal structure, and to allow for a comparison of Fred Lerdahl and Ray Jackendoff’s prolongational trees to temporal structures. This suggests an enrichment of MOPs through spanning trees, and is channelled into a discussion of graph-theoretic algebras, cycle and edge-cut algebras, as they apply to temporal structures.

Sign in / Sign up

Export Citation Format

Share Document