Results 121 to 130 of about 41,123 (303)
Tails of Bipartite Distance-regular Graphs
European Journal of Combinatorics, 2002 Let \(\Gamma \) denote a bipartite distance-regular graph with diameter \(D\geq 4\) and valency \(k\geq 3\). Let \(\theta _{0}>\theta _{1}>\cdots >\theta _{D}\) denote the eigenvalues of \(\Gamma \) and let \(E_{0}, E_{1},\ldots ,E_{D}\) denote the associated primitive idempotents.
openaire +1 more source
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 +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
Retracing Argument for Distance-Regular Graphs
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra [PDF]
, 2006 Let Γ be a distance-regular graph of diameter D. Suppose that Γ does not have any induced subgraph isomorphic to K2,1,1. In this case, the length of a shortest reduced circuit in Γ is called the geometric girth gg(Γ) of Γ.
Suzuki, Hiroshi
core +1 more source
An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials
Advanced Engineering Materials, EarlyView.An entire workflow for the high‐throughput characterization and analysis of compositionally graded magnetic films is presented. Characterization protocols, data management tools and data analysis approaches are illustrated with test case Sm(Fe, V)12 based films.
William Rigaut +16 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 +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article presents an experimental and numerical modal investigation of composite sandwich structures using surfboards as model systems. By comparing different core materials and reinforcement strategies, the study demonstrates how local stiffeners influence vibrational response and introduce characteristic modal features, highlighting modal ...
Brett Connellan +4 more
wiley +1 more source
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +1 more source
Some matrices associated with the split decomposition for a Q-polynomial distance-regular graph [PDF]
, 2009 We consider a Q-polynomial distance-regular graph Γ with vertex set X and diameter D≥3. For μ,ν∈{↓,↑} we define a direct sum decomposition of the standard module V=CX, called the (μ,ν)-split decomposition.
Kim, Joohyung
core +1 more source