Results 91 to 100 of about 159,188 (266)
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n.
Hamamache Kheddouci, Olivier Togni
doaj
Distance majorization sets in graphs
, 2015 Summary: Let \(G=(V,E)\) be a simple graph. A subset \(D\) of \(V(G)\) is said to be a distance majorization set (or dm-set) if for every vertex \(u\in V-D\), there exists a vertex \(v\in D\) such that \(d(u,v)\geq\deg(u)+\deg(v)\). The minimum cardinality of a dm-set is called the distance majorization number of \(G\) (or dm-number of \(G)\) and is ...
R.SUNDARESWARAN, -, V.SWAMİNATHAN, -
openaire +3 more sources
On distances in generalized Sierpiński graphs
Applicable Analysis and Discrete Mathematics, 2018 In this paper we propose formulas for the distance between vertices of a generalized Sierpi?ski graph S(G, t) in terms of the distance between vertices of the base graph G. In particular, we deduce a recursive formula for the distance between an arbitrary vertex and an extreme vertex of S(G, t), and we obtain a recursive formula for the distance ...
Estrada-Moreno, Alejandro +2 more
openaire +4 more sources
Advanced Engineering Materials, EarlyView.This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Ural Mathematical Journal, 2018 Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
doaj +1 more source
What Do Large Language Models Know About Materials?
Advanced Engineering Materials, EarlyView.If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This article demonstrates the successful qualification of a copper–tungsten composite for laser powder bed fusion. The resulting components exhibited high density, high thermal conductivity, and reduced thermal expansion. Heat sinks with complex geometries were successfully manufactured, clearly showcasing the material's potential for additive ...
Simon Rauh +6 more
wiley +1 more source
Distance spectrum of Indu–Bala product of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by
G. Indulal, R. Balakrishnan
doaj +1 more source
Improved Distance Queries in Planar Graphs [PDF]
, 2011 There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and query time. In this paper we present three data structures that answer such queries, each with its own advantage over previous data structures.
openaire +2 more sources