Results 131 to 140 of about 40,584 (295)
Universal Adjacency Matrices with Two Eigenvalues
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core
On valency of Strongly regular graph with p^2 vertices
, 1998 P(論文)"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent pair of vertices has λ between vertices, each non-adjacent pair of vertices has μ between vertices.
IWANE, Hiroshi +5 more
core
On strongly regular bicirculants
, 2007 An n-bicirculant is a graph having an automorphism with two orbits of length n and no other orbits. This article deals with strongly regular bicirculants.
Malnič, Aleksander +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
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 +17 more
wiley +1 more source
On regular and strongly-regular self-complementary graphs
Discrete Mathematics, 1985 A graph G is called self-complementary, if it is isomorphic to its own complement. The symbol \({\mathcal C}(G)\) denotes the set of permutations of the vertex set V(G) of G which induce isomorphisms of G onto its complement. Further F(G) is the set of all vertices u of G for which there exists \(\sigma\in {\mathcal C}(G)\) such that \(\sigma (u)=u ...
openaire +2 more sources
Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra.
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core
Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators
Advanced Engineering Materials, EarlyView.A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad +6 more
wiley +1 more source
On triple systems and strongly regular graphs
, 2012 The block graph of a Steiner triple system of order v is a (v(v−1)/6,3(v−3)/2,(v+3)/2,9) strongly regular graph. For large v, every strongly regular graph with these parameters is the block graph of a Steiner triple system, but exceptions exist for small
Behbahani, Majid +2 more
core +1 more source
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
Advanced Engineering Materials, EarlyView.We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source