National Yang Ming Chiao Tung University

output

20022009

most citedCritical thickness and orbital ordering in ultrathin La0.7Sr0.3MnO3 films

422 citations

researchers with a paper here

collaborating institutions

Showing math.COShow all

6 papers · 1 filter

math.CO2008★ 1 cited

The edge-flipping group of a graph

Hau-wen Huang, Chih-wen Weng

Let $X = (V, E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X .$ A move…

math.CO2008★ 2 cited

The flipping puzzle on a graph

Hau-wen Huang, Chih-wen Weng

Let $S$ be a connected graph which contains an induced path of $n - 1$ vertices, where $n$ is the order of $S .$ We consider a puzzle on $S$ . A configuration of the puzzle is simply a…

math.CO2007

3-bounded property in a triangle-free distance-regular graph

Yeh-jong Pan, Chih-wen Weng

Let $Γ$ denote a distance-regular graph with classical parameters $(D, b, α, β)$ and $D \geq 3$ . Assume the intersection numbers $a_{1} = 0$ and $a_{2} \neq = 0$ . We show $Γ$ is 3-bounded in…

math.CO2003

An inequality for regular near polygons

Paul Terwilliger, Chih-wen Weng

Let $G$ denote a near-polygon distance-regular graph with diameter $d \geq 3$ , valency $k$ and intersection numbers $a_{1} > 0$ , $c_{2} > 1$ . Let $θ_{1}$ denote the second largest eigenvalue…

math.CO2003

Isometric path numbers of graphs

Jun-Jie Pan, Gerard J. Chang

An isometric path between two vertices in a graph $G$ is a shortest path joining them. The isometric path number of $G$ , denoted by $\ip(G)$, is the minimum number of isometric pat…

math.CO2003

Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra

Paul Terwilliger, Chih-wen Weng

Let $Γ$ denote a distance-regular graph with diameter $D \geq 3$ and Bose-Mesner algebra $M$ . For $θ \in C \cup \infty$ we define a 1 dimensional subspace of $M$ which we call $M (θ)$ .…