Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DAM
2011
9 years 5 months ago
Triangular line graphs and word sense disambiguation
Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...
Pranav Anand, Henry Escuadro, Ralucca Gera, Craig ...
JSC
2010
132views more  JSC 2010»
9 years 12 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
DM
2008
76views more  DM 2008»
10 years 1 months ago
On s-hamiltonian-connected line graphs
A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deleti...
Hong-Jian Lai, Yanting Liang, Yehong Shao
COMBINATORICS
1999
95views more  COMBINATORICS 1999»
10 years 1 months ago
Maximum Degree Growth of the Iterated Line Graph
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
Stephen G. Hartke, Aparna W. Higgins
JGT
2007
85views more  JGT 2007»
10 years 1 months ago
Coloring quasi-line graphs
A graph G is a quasi-line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset ...
Maria Chudnovsky, Alexandra Ovetsky
JCT
2006
64views more  JCT 2006»
10 years 1 months ago
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
CORR
2007
Springer
111views Education» more  CORR 2007»
10 years 1 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
DM
2008
111views more  DM 2008»
10 years 1 months ago
Planarity of iterated line graphs
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....
Mohammad Ghebleh, Mahdad Khatirinejad
HCI
2001
10 years 2 months ago
Towards generating textual summaries of graphs
For people who use text-based web browsers, graphs, diagrams, and pictures are inaccessible. Yet, such diagrams are quite prominent in documents commonly found on the web. In this...
Kathleen F. McCoy, Sandra Carberry, Tom Roper, Nan...
AVI
2006
10 years 3 months ago
Line graph explorer: scalable display of line graphs using Focus+Context
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
Robert Kincaid, Heidi Lam
books