Results 21 to 30 of about 196,583,728 (297)
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
Complexity of approximating bounded variants of optimization problems [PDF]
, 2006 We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional ...
Chlebikova, Janka +3 more
core +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Angle Covers: Algorithms and Complexity
Journal of Graph Algorithms and Applications, 2021 Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering- an angle- such that each edge ...
William Evans +3 more
doaj +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
Random graphs with forbidden vertex degrees [PDF]
Random Structures & Algorithms, 2010 Abstract We study the random graph G n ,λ/ n conditioned on the event that all vertex degrees lie in some given subset ...
Geoffrey R. Grimmett, Svante Janson
openaire +4 more sources
Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application [PDF]
Neutrosophic Sets and Systems, 2020 Unipolar is less fundamental than bipolar cognition based on truth, and composure is a restraint for truth-based worlds. Bipolarity is the most powerful phenomenon that survives when truth disappeared in a black hole due to Hawking radiation or ...
M. Aslam Malik +5 more
doaj +1 more source
Random Graphs' Robustness in Random Environment
Austrian Journal of Statistics, 2017 We consider configuration graphs the vertex degrees of which are independent and follow the power-law distribution. Random graphs dynamics takes place in a random environment with the parameter of vertex degree distribution following uniform ...
Marina Leri, Yury Pavlov
doaj +1 more source
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
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