Search
Search Results
-
JAK-STAT and G-protein-coupled receptor signaling pathways are frequently altered in epitheliotropic intestinal T-cell lymphoma
Epitheliotropic intestinal T-cell lymphoma (EITL, also known as type II enteropathy-associated T-cell lymphoma) is an aggressive intestinal disease...
-
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two
The core G Δ of a graph G is the subgraph of G induced by the vertices of maximum degree Δ( G ). In this paper, we show that if G is a connected graph...
-
-
The search for chromatically unique graphs
The number of vertex-colourings of a simple graph G in not more than λ colours is a polynomial in λ. This polynomial, denoted by P(G, λ) , is called the...
-
On the factor-thickness of regular graphs
For each r -regular graph G , define a binary sequence θ(G) = ( θ 1 , θ 2 ,..., θ r -1 ) by θ k = 0 if G has a k -factor, and θ k = 1 otherwise. A binary sequence ε = (
-
On a construction of critical graphs which are not sensitive
Let ℒ( G ) be the closed-set lattice of a graph G. G is sensitive if the following implication is always true for any graph G′ : ℒ( G )≅ℒ( G ′)⇒( G )≅ G ′ G is critical...
-
On an isomorphism problem on the closed-set lattice of a graph
Let ℒ (G) and V(G) be, respectively, the closed-set lattice and the vertex set of a graph G . Any lattice isomorphism Φ: ℒ V(G) ≃ℒ (G′) induces a...
-
-
Interlaced trees: A class of graceful trees
Ringel conjectured that every tree has a graceful valuation. While this conjecture remains unsettled, it is apparent, from examples, that some trees... -
An algorithm for determining Φ(L) in finite distributive lattices
Following G. Birkhoff, the Frattini sublattice Φ( L ) of a lattice L is defined as the intersection of all its maximal proper sublattices. Let ℒ( FD ) be...