Results 31 to 40 of about 309,095 (284)
Group Degree Centrality and Centralization in Networks
Mathematics, 2020 The importance of individuals and groups in networks is modeled by various centrality measures. Additionally, Freeman’s centralization is a way to normalize any given centrality or group centrality measure, which enables us to compare individuals or ...
Matjaž Krnc, Riste Škrekovski
doaj +1 more source
Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices
Discrete Dynamics in Nature and Society, 2022 The geometric-arithmetic (GA) index of a graph G is the sum of the ratios of geometric and arithmetic means of end-vertex degrees of edges of G. Similarly, the arithmetic-geometric (AG) index of G is defined. Recently, Vujošević et al. conjectured that a
Zainab Alsheekhhussain +3 more
doaj +1 more source
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 +2 more sources
A bandwidth theorem for approximate decompositions [PDF]
, 2018 We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$.
Condon, Padraig +3 more
core +3 more sources
Faster exponential-time algorithms in graphs of bounded average degree [PDF]
, 2013 We first show that the Traveling Salesman Problem in an n-vertex graph with average degree bounded by d can be solved in O*(2^{(1-\eps_d)n}) time and exponential space for a constant \eps_d depending only on d, where the O*-notation suppresses factors ...
A. Björklund +6 more
core +2 more sources
Random graphs with forbidden vertex degrees [PDF]
Random Structures & Algorithms, 2010 AbstractWe 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 asymptotically Poisson with some parameter $ \hat{\mu} $ given as the root of a certain ...
Grimmett, Geoffrey, Janson, Svante
openaire +3 more sources
Random graphs with arbitrary degree distributions and their applications
, 2001 Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past.
A. Broder +46 more
core +1 more source
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj
Reducing the maximum degree of a graph by deleting vertices: the extremal cases
Theory and Applications of Graphs, 2018 Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. In a recent paper, we proved that if $n$ is the number of vertices of $G$, $k$ is the maximum
Peter Borg, Kurt Fenech
doaj +1 more source
A straightforward edge centrality concept derived from generalizing degree and strength
Scientific Reports, 2022 Vertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and ...
Timo Bröhl, Klaus Lehnertz
doaj +1 more source