5,647 research outputs found
Finding the edge ranking number through vertex partitions
No full text[[abstract]]An edge coloring c': E -> {1, 2,..., t} of a graph G = (V, E) is an edge t-ranking if for any two edges of the same color, every path between them contains an intermediate edge with a larger color. The edge ranking number chi(r)'(G) is the smallest value of t such that G has an edge t-ranking. In this paper, we introduce a relation between edge ranking number and vertex partitions. By using the proposed recurrence formula, we show that the edge ranking number of the Sierpinski graph chi(r)'(S(n, k)) = n chi(r)'(K-k) for any n, k >= 2 where K-k denotes a complete graph of k vertices. (C) 2012 Elsevier B.V. All rights reserved.[[note]]SC
Indoor and outdoor environmental exposures, parental atopy, and physician-diagnosed asthma in Taiwanese schoolchildren.
No full textTime trend of asthma prevalence among middle school children in Taiwan: ISAAC phases I and III surveys.
No full textThe association between glutathione S-transferase P1, M1 polymorphisms and asthma in Taiwanese schoolchildren.
No full textTraffic-related air pollution as a determinant of asthma among Taiwanese school children.
No full text
Are maternal psychosocial factors associated with cord immunoglobulin E in addition to family atopic history and mother immunoglobulin E?
No full text
- …
