Results 31 to 40 of about 196,583,728 (297)
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 +3 more sources
On the measure of polynomials attaining maxima on a vertex [PDF]
, 2019 We calculate the probability that a k-homogeneous polynomial in n variables attain a local maximum on a vertex in terms of the “sharpness” of the vertex, and then study the dependence of this measure on the growth of dimension and degree.
Ignacio Zalduendo +3 more
core +1 more source
On Vertex-Degree-Based Indices of Monogenic Semigroup Graphs
, 2022 Albertson and the reduced Sombor indices are vertex-degree-based graph invariants that given ...
Ünal, Seda Oğuz +2 more
core +1 more source
Limit distributions of maximum vertex degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +1 more source
Degree subtraction eigenvalues and energy of graphs [PDF]
Computer Science Journal of Moldova, 2018 The degree subtraction matrix $DS(G)$ of a graph $G$ is introduced, whose $(j,k)$-th entry is $d_G(v_j) - d_G(v_k)$, where $d_G(v_j)$ is the degree of a vertex $v_j$ in $G$.
H. S. Ramane +3 more
doaj
Computing the degree of some matchings in a graph
The American Journal of CombinatoricsLet \(G\) be a connected graph. A matching \(M\) in \(G\) is a set of edges of \(G\) without two of them adjacent (having a common vertex). The graph whose vertices are the matchings in \(G\) and two matchings \(M\) and \(N\) are adjacent if and only if
Rosário Fernandes
doaj +1 more source
A SURVEY M-POLAR FUZZY GRAPHS [PDF]
Fiabilitate şi Durabilitate, 2019 I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, H., Manlove, D.F.
core +1 more source
Vertex-centric communities on degree-1 vertices.
, 2017 We do not calculate extended vertex-centric communities for seed vertices of degree equal to 1. However, they may be included in extended communities centered on other vertices.
Yiannis Kompatsiaris (3826402) +2 more
core +1 more source
Towards plane spanners of degree 3
Journal of Computational Geometry, 2017 Let $S$ be a finite set of points in the plane. In this paper we consider the problem of computing plane spanners of degree at most three for $S$. • If $S$ is in convex position, then we present an algorithm that constructs a plane $\frac{3+4\pi}{3 ...
Ahmad Biniaz +5 more
doaj +1 more source