Results 21 to 30 of about 908,664 (294)
Li filtrations of SUSY vertex algebras [PDF]
, 2022 Any vertex algebra has a canonical decreasing filtration, called the Li filtration, whose associated graded space has a natural structure of a vertex Poisson algebra.
Yanagida, Shintarou
core +1 more source
Vertex arboricity and maximum degree
Discrete Mathematics, 1995 This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
Paul A. Catlin, Hong-Jian Lai
openaire +2 more sources
Degree distance and vertex-connectivity
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Ali +2 more
openaire +2 more sources
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
On second Zagreb index and coindex of some derived graphs [PDF]
Kragujevac Journal of Science, 2015 The second Zagreb index is defined as the sum of the products of the degrees of adjacent vertices. In this note, we examine the second Zagreb indices of some derived graphs and find expressions for these in terms of vertex degrees.
Bommanahal Basavanagoud +2 more
doaj +1 more source
On the Vertex-Degree Based Invariants of Digraphs
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
openaire +4 more sources
On limit distributions of vertex degrees in a configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015 The configuration graph where vertex degrees are independent identically distributed random variables is often used for models of complex networks such as the Internet. We consider a random graph consisting of N+1 vertices.
Irina Cheplyukova
doaj +1 more source
مجلة بغداد للعلوم, 2023 This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η ...
ARCHANA S., PREETHI KUTTIPULACKAL
doaj +1 more source
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