Results 31 to 40 of about 52,307 (305)
Weakly discriminating vertex-degree-based topological indices [PDF]
, 2022 Let Gn be the set of graphs with n vertices and H ⊆ Gn. For each H ∈ H, let m(H) = {mi,j (H)}, where mi,j (H) is the number of edges in H that join a vertex of degree i with a vertex of degree j. A vertex-degree-based (VDB, for short) topological index φ
Sigarreta Almira, José María +2 more
core +1 more source
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 The two Zagreb indices and are vertex-degree-based graph invariants that have been introduced in the 1970s and extensively studied ever since. In the last few years, a variety of modifications of and were put forward. The present survey of these modified
Ivan Gutman +2 more
doaj +1 more source
Cost-based analyses of random neighbor and derived sampling methods
Applied Network Science, 2022 Random neighbor sampling, or RN, is a method for sampling vertices with a mean degree greater than that of the graph. Instead of naïvely sampling a vertex from a graph and retaining it (‘random vertex’ or RV), a neighbor of the vertex is selected instead.
Yitzchak Novick, Amotz Bar-Noy
doaj +1 more source
On Vertex-Degree-Based Indices of Monogenic Semigroup Graphs [PDF]
, 2022 Albertson and the reduced Sombor indices are vertex-degree-based graph invariants that given ...
Ünal, Seda Oğuz
core +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
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source
Degree-constrained graph partition [PDF]
, 2019 In this paper, we consider the task of partitioning a given graph intwo two non-empty subgraphs such that one of them has no vertex of degree less than 2, the other has no vertex of degree less than 3.
Thinh D. Nguyen (6385907)
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 +1 more source
THE ZAGREB ECCENTRIC VERTEX DEGREE INDICES OF NANOTUBES AND NANOTORI [PDF]
, 2016 The eccentric vertex degree of a vertex v of a simple connected graph G, e(v), is defined as: max{d(u1),d(u2,) ..., d(un)}, where d(ui) denotes the degree of the vertex of u(i) which is one of the furthest vertices from v.
Ediz, Süleyman
core +1 more source