Results 21 to 30 of about 2,443,466 (313)

A Note on the Maximum Genus of Graphs with Diameter 4 [PDF]

open access: yes, 2007
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order ...
WeiLi, He, Xiang, Ren, Lin, Zhao
core   +1 more source

BILOLOGICAL STUDY OF JOHNSONGRASS (Sorghum halepense L.) RHIZOMES [PDF]

open access: yesMesopotamia Journal of Agriculture, 2017
The experiment was conducted out under the conditions of the greenhouse at the Field of Crop Science, Mosul University on 2012. The aim of the research is to study the effect of length and diameter of Johnsongrass rhizomes planted at different densities ...
T. Al-Hially
doaj   +1 more source

Diameter partitioning [PDF]

open access: yesDiscrete & Computational Geometry, 1986
Given a set P of points, the diameter of P is the maximum distance of two points from P. In the paper, point sets are partitioned into two subsets satisfying certain requirements on the diameters, and cardinalities or displacement. The problems investigated about such partitions have algorithmic character.
openaire   +1 more source

On the Diameter of Lattice Polytopes [PDF]

open access: yesDiscrete & Computational Geometry, 2016
In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for half-integral polytopes the latter bound is tight for any d.
Alberto Del Pia, Carla Michini
openaire   +3 more sources

Study on potential of wood production of various Poplar species and clones in northern forest areas (Case study: Siahkal region in Guilan province) [PDF]

open access: yesتحقیقات جنگل و صنوبر ایران, 2011
First phase of research project for establishment and adaptation of different poplar species and clones in northern Iran was started on 1992 and lasts for 15 years.
Ebrahim Lashkarbolouki   +3 more
doaj   +1 more source

On the diameter of dot-critical graphs [PDF]

open access: yesOpuscula 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

Reference values of normal abdominal aortic areas in Chinese population measured by contrast-enhanced computed tomography

open access: yesFrontiers 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

Minimum Zagreb Eccentricity Indices of Two-Mode Network with Applications in Boiling Point and Benzenoid Hydrocarbons

open access: yesMathematics, 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

The diameter of caterpillar associahedra

open access: yesCoRR, 2021
The caterpillar associahedron $\mathcal{A}(G)$ is a polytope arising from the rotation graph of search trees on a caterpillar tree $G$, generalizing the rotation graph of binary search trees (BSTs) and thus the conventional associahedron. We show that the diameter of $\mathcal{A}(G)$ is $Θ(n + m \cdot (H+1))$, where $n$ is the number of vertices, $m ...
openaire   +4 more sources

Parameterized Complexity of Diameter [PDF]

open access: yesAlgorithmica, 2019
AbstractDiameter—the task of computing the length of a longest shortest path—is a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis, there is no $$O(n^{1.99})$$ O ( n 1.99
Bentert, Matthias, Nichterlein , André
openaire   +4 more sources

Home - About - Disclaimer - Privacy