Results 11 to 20 of about 3,967,804 (356)
Toughness and Vertex Degrees [PDF]
Journal of Graph Theory, 2009 We study theorems giving sufficient conditions on the vertex degrees of a graph G to guarantee G is t‐tough. We first give a best monotone theorem when t≥1 , but then show that for any integer k≥1 , a best monotone theorem for t=1k≤1 requires at least f ...
D. Bauer +4 more
semanticscholar +6 more sources
Estimation of vertex degrees in a sampled network [PDF]
2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017 The need to produce accurate estimates of vertex degree in a large network, based on observation of a subnetwork, arises in a number of practical settings.
Apratim Ganguly, E. Kolaczyk
semanticscholar +4 more sources
Random graphs with forbidden vertex degrees [PDF]
Random Structures & Algorithms, 2007 We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset $ {\cal S} $ of the nonnegative integers. Subject to a certain hypothesis on $ {\cal S} $, the empirical distribution of the vertex degrees is ...
G. Grimmett, S. Janson
semanticscholar +5 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
openalex +5 more sources
On the vertex-degree based invariants of digraphs [PDF]
Discrete Mathematics Letters, 2021 Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $φ$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{φ(d_u^+,d_v^-)}$, where $d_u^+$ (resp. $d_u^-$) denotes the out-degree (resp. in-degree) of a vertex $u$.
Hanyuan Deng +4 more
openalex +5 more sources
Testing the quality of molecular structure descriptors. Vertex-degree-based topological indices [PDF]
Vojnotehnicki glasnik, 2012 Introduction/purpose: In the current literature, several dozens of vertex-degree-based (VDB) graph invariants are being studied. To each such invariant, a matrix can be associated. The VDB energy is the energy (= sum of the absolute values of the eigenvalues) of the respective VDB matrix.
İvan Gutman, Jelena Tošović
openalex +4 more sources
Vertex degrees of planar graphs
Journal of Combinatorial Theory, Series B, 1979 AbstractLet G be a planar graph having n vertices with vertex degrees d1, d2,…,dn. It is shown that Σi=1ndi2 ≤ 2n2 + O(n). The main term in this upper bound is best possible.
R.J Cook
semanticscholar +2 more sources
First and Second Zagreb Coindices for Chains of Cycles [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2023 —The graphs which are used in this paper are simple, finite and undirected. The first and second Zagreb indices for every non-adjacent vertices (also called first and second Zagreb coindices) are dependent only on the non-adjacent vertices degrees ...
Ammar Waadallah, Ahmed Ali
doaj +1 more source
Note on the Reformulated Zagreb Indices of Two Classes of Graphs
Journal of Chemistry, 2020 The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of its two end vertices minus 2.
Tongkun Qu +3 more
doaj +1 more source
ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj +1 more source