Results 11 to 20 of about 310,757 (283)
Degree distance and vertex-connectivity
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali, P., Mukwembi, S., Munyira, S.
openaire +4 more sources
Self-locking degree-4 vertex origami structures [PDF]
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2016 A generic degree-4 vertex (4-vertex) origami possesses one continuous degree-of-freedom for rigid folding, and this folding process can be stopped when two of its facets bind together. Such facet-binding will induceself-lockingso that the overall structure stays at a pre-specified configuration without additional locking elements or actuators.
Hongbin Fang, Suyi Li, K. W. Wang
openaire +5 more sources
Vertex degrees close to the average degree
Discrete Mathematics, 2023 Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular, for $d_+\in \left(\sqrt{dn},n-1\right]$, we show the existence of a vertex in $G$ of degree between $d_+-\left ...
Pardey, Johannes, Rautenbach, Dieter
openaire +3 more sources
Graph realizations: Maximum degree in vertex neighborhoods
Discrete Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amotz Bar-Noy +3 more
openaire +4 more sources
On vertex and edge degree-based topological indices
Vojnotehnički Glasnik, 2023 Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj +1 more source
On topological properties of hierarchical hypercube network based on Ve and Ev degree
Main Group Metal Chemistry, 2021 Grid implementation is a principal unit in electrical and electronic engineering but it depends on the domain of these projects. For example, depending on the grid and the signal processing in that fields of electronic and electrical engineering, such as
Zahra Nida, Ibrahim Muhammad
doaj +1 more source
The topological uniqueness of the deltahedra found in the boranes BnHn2− (6≤n≤12) [PDF]
, 1990 The deltahedra observed experimentally in the borane anions BnHn2− (6≤n≤12) are the only possible n-vertex deltahedra having only degree 4 and 5 vertices.
Duijvestijn, A.J.W., King, R.B.
core +2 more sources
Detecting degree symmetries in networks [PDF]
, 2006 The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping degree sequences.
Petter Holme +4 more
core +2 more sources
Usefulness of Combinations of Vertex-Degree Weighted Path Indices and Elements of a Universal Matrix
Acta Chimica Slovenica, 2019 The mutually optimized combinations of vertex-degree weighted path indices and the vertex-degree vertex-distance weighted elements of the Universal matrix were applied in the way of TInew = ∑kN×PN(aN,bN,...) + kij×uij(aij,bij,cij).
Anton Perdih
doaj +1 more source
Cost-based analyses of random neighbor and derived sampling methods
Applied Network Science, 2022 Random neighbor sampling, or RN, is a method for sampling vertices with a mean degree greater than that of the graph. Instead of naïvely sampling a vertex from a graph and retaining it (‘random vertex’ or RV), a neighbor of the vertex is selected instead.
Yitzchak Novick, Amotz Bar-Noy
doaj +1 more source