Results 91 to 100 of about 42,350 (268)

Some Inequalities in Distance-Regular Graphs

Journal of Combinatorial Theory, Series B, 1993
For integers \(r\) \((>0)\) and \(a\), let \(n_ r(a)\) denote the following value \[ n_ r(a)= 1+ a+ a(a- 1)+\cdots+ a(a-1)^ i+\cdots+ a(a-1)^ r. \] In this paper, we prove the following theorem and give several corollaries. Theorem. Let \(G\) be a distance-regular graph with girth \(g\) and diameter \(d\).
openaire   +2 more sources

Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization

Advanced Engineering Materials, EarlyView.
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier, Moritz Blum, Luana Caron, Alisa Chirkova, Philipp Cimiano, Basil Ell, Inga Ennen, Michael Feige, Maik Gaerner, Thomas Hilbig, Andreas Hütten, Günter Reiss, Tapas Samanta, Sonja Schöning, Christian Schröder, Lennart Schwan, Chris Taake, Martin Wortmann   +17 more
wiley   +1 more source

On comparison between the distance energies of a connected graph

Heliyon
Let G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie, Bilal Ahmad Rather, Yilun Shang   +2 more
doaj   +1 more source

Workflow for Design of Experiments‐Based Modeling of Species Transport and Growth Kinetics in GaN Hydride Vapor Phase Epitaxy

Advanced Engineering Materials, EarlyView.
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič, G. Lukin, H. Torkashvand, A. Kerschbaum, M. Müller, S. Besendörfer, J. Heitmann, J. Friedrich   +7 more
wiley   +1 more source

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

Advanced Engineering Materials, EarlyView.
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari, Abril Azocar Guzman, Sarath Menon, Stefan Sandfeld, Tilmann Hickel, Markus Stricker   +5 more
wiley   +1 more source

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

Advanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

On regular handicap graphs of order $n \equiv 0$ mod 8

Electronic Journal of Graph Theory and Applications, 2018
A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, …, n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1), w(x2)
Dalibor Froncek, Aaron Shepanik
doaj   +1 more source

Merging in Antipodal Distance-Regular Graphs

Journal of Combinatorial Theory, Series B, 1994
Merging (also called fusion) is studied in antipodal distance-regular graphs. It is determined when merging the first and the last classes in an antipodal distance-regular graph produces a distance-regular graph. Conversely, given a distance-regular graph with the same intersection array as the merged graph and a certain clique partition, an antipodal ...
openaire   +2 more sources

OntOMat: Toward Ontology‐Based Product and Process Design Engineering and Optimization Solutions Fueling Circular Value Chains

Advanced Engineering Materials, EarlyView.
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ, Jörg Hohe, Martin Kördel, Michael Giese, Niklas Toffert, Christian Seidel, Olaf Rehme, Patrik Schneider, Oliver Focke, Elie Abi Aoun, Claas Falldorf, Beñat Gutierrez, Alexandra Kühn, Sven Torstrick-von der Lieth, Christoph Herden, Erik Johannsen, Jan‐Uwe R. Schmidt, Felix Winkelmann, Andreas Schott, Daniel Schott   +19 more
wiley   +1 more source

Handicap Labelings of 4-Regular Graphs

Advances in Electrical and Electronic Engineering, 2017
Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar, Michal Kravcenko, Matej Krbecek, Adam Silber   +3 more
doaj   +1 more source