Results 51 to 60 of about 21,234 (294)
Topological indices are not necessarily invariant to graph labeling
Each element of the Universal matrix U (vertex-degree vertex-distance weighted matrix) represents the mutual contribution of two vertices weighted for the vertex degrees and the distance between them.
Anton Perdih
doaj +1 more source
On the Vertex-Connectivity of an Uncertain Random Graph
In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj +1 more source
Association Between Motor Pathway Damage and Motor Deficit in Upper and Lower Limb in People With MS
ABSTRACT Objective Corticospinal tract damage is common in people with MS, but the degree of clinical symptoms varies. We hypothesize that corticospinal tract lesions are more extensive and severe in people with MS with motor impairments in both upper and lower limbs.
Mathilde Liffran +13 more
wiley +1 more source
New Results on the Forgotten Topological Index and Coindex
The ℱ-coindex (forgotten topological coindex) for a simple connected graph G is defined as the sum of the terms ζG2y+ζG2x over all nonadjacent vertex pairs x,y of G, where ζGy and ζGx are the degrees of the vertices y and x in G, respectively.
Akbar Jahanbani +2 more
doaj +1 more source
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
Effect of Laser Deoxidation on Adhesive‐Bonded Aluminum in an Oxygen‐Free Atmosphere
This study investigates laser ablation of aluminum under oxygen‐free conditions. The goal is to produce oxide‐free substrates that enable improved adhesive bonding with epoxy. Optimized laser parameters (90% overlap, 300 µJ) combined with oxide‐free substrates result in the highest tensile strength of the adhesive bond.
Sandra Gerland +5 more
wiley +1 more source
Random graphs with given vertex degrees and switchings
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph.
Janson, Svante,, Svante Janson
core +1 more source
Single‐crystal gold microplates are high‐performance nanomaterials with an impressive wafer‐based application space. Progress has, however, been tempered by an inability to exert synthetic control over microplate size, shape, and positioning. In this work, control over these parameters is demonstrated using a seed‐mediated synthesis that both confines ...
Debasish Panda +9 more
wiley +1 more source
Crossing number is hard for cubic graphs
It was proved by [Garey, Johnson] that computing the crossing number of a graph is an NP -hard problem. Their reduction, however, used parallel edges and vertices of very high degrees.
Petr Hlineny +7 more
core +1 more source
Induced Subgraphs With Many Distinct Degrees [PDF]
Let hom(G) denote the size of the largest clique or independent set of a graphG. In 2007, Bukh and Sudakov proved that everyn-vertex graphGwith hom(G) =O(logn) contains an induced subgraph with Ω(n1/2) distinct degrees, and raised the question of ...
ISTVÁN TOMON, BHARGAV NARAYANAN
core +1 more source

