Results 1  10
of
959,228
Coloring quasiline graphs
 J. GRAPH THEORY
, 2006
"... A graph G is a quasiline graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasiline graphs is a proper superset of the class of line graphs. A theorem of Shannon’s implies that if G is a line graph then it can be properly colored usi ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
A graph G is a quasiline graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasiline graphs is a proper superset of the class of line graphs. A theorem of Shannon’s implies that if G is a line graph then it can be properly colored
Collapsible Graphs and Hamiltonicity of Line Graphs
, 2014
"... Thomassen conjectured that every 4connected line graph is Hamiltonian. Chen and Lai ..."
Abstract
 Add to MetaCart
Thomassen conjectured that every 4connected line graph is Hamiltonian. Chen and Lai
A Note On Line Graphs
"... Abstract: In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems. ..."
Abstract
 Add to MetaCart
Abstract: In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems.
Families of linegraphs and their quantization
, 2008
"... Any directed graph G with N vertices and J edges has an associated linegraph L(G) where the J edges form the vertices of L(G). We show that the nonzero eigenvalues of the adjacency matrices are the same for all graphs of such a family L n (G). We give necessary and sufficient conditions for a line ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Any directed graph G with N vertices and J edges has an associated linegraph L(G) where the J edges form the vertices of L(G). We show that the nonzero eigenvalues of the adjacency matrices are the same for all graphs of such a family L n (G). We give necessary and sufficient conditions for a
On defensive alliances and line graphs
 APPLIED MATHEMATICS LETTERS
, 2006
"... Let Γ be a simple graph of size m and degree sequence δ1 ≥ δ2 ≥ · · · ≥ δn. Let L(Γ) denotes the line graph of Γ. The aim of this paper is to study mathematical properties of the alliance number, a(L(Γ), and the global alliance number, γa(L(Γ)), of the line graph of a simple graph. We show that δ ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Let Γ be a simple graph of size m and degree sequence δ1 ≥ δ2 ≥ · · · ≥ δn. Let L(Γ) denotes the line graph of Γ. The aim of this paper is to study mathematical properties of the alliance number, a(L(Γ), and the global alliance number, γa(L(Γ)), of the line graph of a simple graph. We show
Assortativity in random line graphs
, 2009
"... We investigate the degreedegree correlations in the ErdösRényi networks, the growing exponential networks and the scalefree networks. We demonstrate that these correlations are the largest for the exponential networks. We calculate also these correlations in the line graphs, formed from the consi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We investigate the degreedegree correlations in the ErdösRényi networks, the growing exponential networks and the scalefree networks. We demonstrate that these correlations are the largest for the exponential networks. We calculate also these correlations in the line graphs, formed from
Segmenting Line Graphs Into Trends
"... Abstract — Information graphics (line graphs, bar charts, etc.) often appear in popular media such as newspapers and magazines. Such graphics generally have a message that they are intended to convey. Our overall project goal is to extract this message. For a line graph, the first step is to segment ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract — Information graphics (line graphs, bar charts, etc.) often appear in popular media such as newspapers and magazines. Such graphics generally have a message that they are intended to convey. Our overall project goal is to extract this message. For a line graph, the first step
CRITICAL GROUPS AND LINE GRAPHS
"... This paper is an overview of what the author has learned about the critical group of a graph, including some new results. In particular we discuss the critical group of a graph in relation to that of its line graph when the original graph is regular. We begin by introducing the critical group from v ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
This paper is an overview of what the author has learned about the critical group of a graph, including some new results. In particular we discuss the critical group of a graph in relation to that of its line graph when the original graph is regular. We begin by introducing the critical group from
Line graph explorer: scalable display of line graphs using focus+context
 In Working Conference on Advanced Visual interfaces
, 2006
"... Scientific measurements are often depicted as line graphs. Stateoftheart high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity of such data, few software systems provide effi ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
Scientific measurements are often depicted as line graphs. Stateoftheart high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity of such data, few software systems provide
Hamiltonian Laceability in Line Graphs
"... A Connected graph G is a Hamiltonian laceable if there exists in G a Hamiltonian path between every pair of vertices in G at an odd distance. G is a HamiltoniantLaceable (Hamiltoniant*Laceable) if there exists in G a Hamiltonian path between every pair (at least one pair) of vertices at distance ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
at distance‘t ’ in G. 1≤ t ≤ diamG. In this paper we explore the Hamiltoniant*laceability number )* ( t of graph L (G) i.e., Line Graph of G and also explore Hamiltoniant*Laceable of Line Graphs of Sunlet graph, Helm graph and Gear graph for t=1,2 and 3.
Results 1  10
of
959,228