Results 31 to 40 of about 11,128 (261)
The spectral radius of graphs with no odd wheels
European Journal of Combinatorics, 2022 The odd wheel $W_{2k+1}$ is the graph formed by joining a vertex to a cycle of length $2k$. In this paper, we investigate the largest value of the spectral radius of the adjacency matrix of an $n$-vertex graph that does not contain $W_{2k+1}$. We determine the structure of the spectral extremal graphs for all $k\geq 2, k\not\in \{4,5\}$. When $k=2$, we
Sebastian M. Cioaba +2 more
openaire +2 more sources
Fundamental study of cornering limit characteristics during braking and driving
Nihon Kikai Gakkai ronbunshu, 2016 The G-G diagram is one way of expressing the cornering limit during braking or driving. When limit driving data is plotted on a graph with the 2 axes representing longitudinal acceleration and lateral acceleration, the shape of the graph indicates the ...
Hideki SAKAI
doaj +1 more source
Shock and Vibration, 2016 Bond graph theory is applied to the modeling and analysis of the vibration characteristics of the in-wheel motor driving vehicle. First, an 11-degree-of-freedom vibration model of the in-wheel motor driving vehicle is established based on bond graph, and
Di Tan, Qiang Wang
doaj +1 more source
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source
Graph Complexes with Loops and Wheels [PDF]
, 2009 Motivated by the problem of deformation quantization we introduce and study directed graph complexes with oriented loops and wheels – differential graded (dg) wheeled props. We develop a new technique for computing cohomology groups of such graph complexes and apply it to several concrete examples such as the wheeled completion of the operad of ...
openaire +1 more source
The Distance Matrices of Some Graphs Related to Wheel Graphs
Journal of Applied Mathematics, 2013 LetDdenote the distance matrix of a connected graphG. The inertia ofDis the triple of integers (n+(D), n0(D), n-(D)), wheren+(D),n0(D), andn-(D)denote the number of positive, 0, and negative eigenvalues ofD, respectively. In this paper, we mainly study the inertia of distance matrices of some graphs related to wheel graphs and give a construction for ...
Xiaoling Zhang 0006, Chengyuan Song
openaire +3 more sources
On eccentricity matrices of wheel graphs
Indian Journal of Pure and Applied MathematicsThe eccentricity matrix $E(G)$ of a simple connected graph $G$ is obtained from the distance matrix $D(G)$ of $G$ by retaining the largest distance in each row and column, and by defining the remaining entries to be zero. This paper focuses on the eccentricity matrix $E(W_n)$ of the wheel graph $W_n$ with $n$ vertices. By establishing a formula for the
I. Jeyaraman, T. Divyadevi
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling +15 more
wiley +1 more source
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
Advanced Materials, EarlyView.This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source