Results 41 to 50 of about 52,307 (305)
On Triangulations with High Vertex Degree [PDF]
Annals of Combinatorics, 2008 We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}.
openaire +2 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
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 ...
Geoffrey R. Grimmett, Svante Janson
openaire +3 more sources
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem [PDF]
, 2018 We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound.
Ordyniak, Sebastian +2 more
core +3 more sources
Generalized Zagreb index of product graphs [PDF]
Transactions on Combinatorics, 2019 The generalized Zagreb index is an extension of both ordinary and variable Zagreb indices. In this paper, we present exact formulae for the values of the generalized Zagreb index for product graphs.
Mahdieh Azari
doaj +1 more source
Influence of the average vertex degree. [PDF]
, 2016 Connection between average vertex degree of a state graph and its total mixing time, respectively canonical path bound.
Steffen Rechner (2174908) +1 more
core +1 more source
Fuzzy Graph Structures with Application
Mathematics, 2019 In this article, we introduce the notions of maximal products of fuzzy graph structures, regular fuzzy graph structures, and describe these notions with examples and properties.
Muzzamal Sitara +2 more
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
Crossing number is hard for cubic graphs [PDF]
, 2004 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 +2 more sources
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