Results 11 to 20 of about 4,577,181 (267)
Variants of Plane Diameter Completion [PDF]
, 2015 The {\sc Plane Diameter Completion} problem asks, given a plane graph $G$ and a positive integer $d$, if it is a spanning subgraph of a plane graph $H$ that has diameter at most $d$.
Golovach, Petr A. +2 more
core +7 more sources
Augmenting graphs to minimize the diameter [PDF]
, 2013 We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph.
A.A. Schoone +14 more
core +1 more source
The diameter of weighted random graphs [PDF]
, 2015 In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression for the maximal weight of the shortest weight paths ...
Amini, Hamed, Lelarge, Marc
core +3 more sources
On the diameter of dot-critical graphs [PDF]
Opuscula Mathematica, 2009 A graph G is \(k\)-dot-critical (totaly \(k\)-dot-critical) if \(G\) is dot-critical (totaly dot-critical) and the domination number is \(k\). In the paper [T. Burtona, D. P.
Doost Ali Mojdeh, Somayeh Mirzamani
doaj +1 more source
Frontiers in Cardiovascular Medicine, 2022 ObjectiveTo generate reference values of the normal areas of the abdominal aorta at various levels among Chinese people and to explore the factors that may promote the expansion of the abdominal aorta.MethodsThe areas of normal abdominal aortas were ...
Xiang Wang +10 more
doaj +1 more source
Mathematics, 2022 A two-mode network is a type of network in which nodes can be divided into two sets in such a way that links can be established between different types of nodes. The relationship between two separate sets of entities can be modeled as a bipartite network.
Ali Al Khabyah +4 more
doaj +1 more source
Algorithms, 2015 Aggregation delay is the minimum number of time slots required to aggregate data along the edges of a data gathering tree (DG tree) spanning all the nodes in a wireless sensor network (WSN).
Natarajan Meghanathan
doaj +1 more source
Bounded diameter arboricity [PDF]
Journal of Graph Theory, 2018 AbstractWe introduce the notion of bounded diameter arboricity. Specifically, the diameter‐ arboricity of a graph is the minimum number such that the edges of the graph can be partitioned into forests each of whose components has diameter at most . A class of graphs has bounded diameter arboricity if there exists a natural number such that every ...
Martin Merker, Luke Postle
openaire +3 more sources
New results for the degree/diameter problem [PDF]
, 1994 The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups.
Dinneen, Michael J., Hafner, Paul R.
core +1 more source
Volume quantity and percentage of Beech industrial, fuel and stump timber portions at Caspian Forests of Iran [PDF]
تحقیقات جنگل و صنوبر ایران, 2005 The aim of the study was to investigate the volume and amount of the Beech (Fagus orientalis) industrial, Fuel and stump timber portions at west forests of Gilan province in Caspian Region of Iran.
Farrokh Poorshakoori Allahdeh +1 more
doaj