A labeling of the vertices of a graph G, Ï† : V (G) â†’ {1, . . . , r}, is said to be r-distinguishing provided no automorphism of the graph preserves all of the vertex labels. The distinguishing numberâ€¦ (More)

In this paper we define and study the distinguishing chromatic number, Ï‡D(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number. We find Ï‡D(G) forâ€¦ (More)

In their 1978 paper \Distance Matrix Polynomials of Trees", [4], Graham and Lov asz proved that the coeÃ†cients of the characteristic polynomial of the distance matrix of a tree (CPD(T )) can beâ€¦ (More)

A classic 3-color theorem attributed to Heawood [10, 11] (also observed by Kempe [16]) states that every even triangulation of the plane is 3-chromatic; by even we mean that every vertex has evenâ€¦ (More)

In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the characteristic polynomial of its distance or adjacency matrix. We also show that the characteristicâ€¦ (More)

PROBLEM
Little is known about the role of peritoneal fibroblasts in adhesion formation. This study determines the effect of hypoxia and transforming growth factor (TGF)-beta1 treatment on theâ€¦ (More)