Search Results

You are looking at 1 - 4 of 4 items for :

Clear All
Restricted access

An upper bound is given on the size of a k-fan-free 3-graph, and an infinite family reaching this bound is also described.

Restricted access

The eccentricitye(v) of a vertexv of a connected graphG is the maximum distance fromv among the vertices ofG. A nondecreasing sequencea 1,a 2, ...,a p of nonnegative integers is said to be an eccentric sequence if there exists a connected graphG of orderp whose vertices can be labelledv 1,v 2, ...,v p so thate(v i)=a i for alli. Several properties of eccentric sequences are exhibited, and a necessary and sufficient condition for a sequence to be eccentric is presented. Sequences which are the eccentricity sequences of trees are characterized. Some properties of the eccentricity sequences of self-complementary graphs are obtained. It is shown that the radius of a nontrivial self-complementary graph is two.

Restricted access
Acta Chromatographica
Authors: Yun Zhou, Guifeng Huang, Xiaolan Li, Feng Chen, Hong Liu, Ying Yang, Zhong Fan, Jinghui Jiang and Jun Yang

)ethanol – – 5.92 ± 0.01 – 34 4-Hydroxy-benzeneethanol 0.46 ± 0.01 a – 1.53 ± 0.02 b 0.61 ± 0.05 c

Open access