Results 11 to 20 of about 309,095 (284)
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
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
On Certain Types of Neutrosophic Fuzzy Graphs
Pan-American Journal of Mathematics, 2022 In this paper, we introduce some types of NF graphs and operations. Also we define the partial NF subgraph, spanning NF subgraph, strong degree of the vertex, total strong degree of the vertex and its properties are included.
Alias B. Khalaf, Prithivirajan Padma
doaj +1 more source
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 +3 more sources
Random Graphs' Robustness in Random Environment
Austrian Journal of Statistics, 2017 We consider configuration graphs the vertex degrees of which are independent and follow the power-law distribution. Random graphs dynamics takes place in a random environment with the parameter of vertex degree distribution following uniform ...
Marina Leri, Yury Pavlov
doaj +1 more source
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source