Results 131 to 140 of about 3,086,920 (343)
Merging in Antipodal Distance-Regular Graphs
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
Distance-regularised graphs are distance-regular or distance-biregular [PDF]
One problem with the theory of distance-regular graphs is that it does not apply directly to the graphs of generalised polygons. In this paper we overcome this difficulty by introducing the class of distance-regularised graphs, a natural common ...
Shawe-Taylor, John +3 more
core +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
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 +5 more
wiley +1 more source
On distance signless Laplacian spectrum and energy of graphs
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source
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 +19 more
wiley +1 more source
Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v.
S. Kavithaa, V. Kaladevi
doaj +1 more source
This article investigates the dependence of the properties on the manufacturing orientation in the form of the inclination angle to the build plate of LPBF‐fabricated NiTi rods with a diameter of 150–220 µm. Metallographic, chemical, thermal, and mechanical characterization show behavior under identical manufacturing conditions that ranges from ...
Sandra Herzig +2 more
wiley +1 more source
Resistance Distance and Kirchhoff Index of
Let Q(G) be the graph derived from G by inserting a new vertex into every edge of G and by connecting edges of these new vertices that are on adjacent edges of G, and Q-double join of G, G1 and G2 denoted by GQ v{G1, G2}, is the graph derived from Q(G ...
Weizhong Wang, Tingyan Ma, Jia-Bao Liu
doaj +1 more source
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core
Architecture‐Driven Sensor Stability in Weft‐Knitted Engineering Textiles
Textile‐integrated sensor architectures are systematically compared to evaluate their electromechanical behavior under combined mechanical and environmental loading. Pocket‐based integration exhibits stable and reproducible signals, whereas tunnel‐based routing shows higher sensitivity accompanied by increased variability.
Adnan Maroof Khan +5 more
wiley +1 more source

