Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,478,583 papers from all fields of science
Search
Sign In
Create Free Account
Line graph
Known as:
Covering lattice
, Derivative (graph theory)
, Theta-obrazom
Expand
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adjacency matrix
Biconnected component
Bridge (graph theory)
Caterpillar tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Visual Analytics for Understanding Traffic Flows of Transport Hubs from Movement Data
L. Ding
,
Jian Yang
,
L. Meng
2015
Corpus ID: 19391260
Transport hubs such as airports, railway stations play an important role in the transportation system and urban development…
Expand
2014
2014
Performance Evaluation of Breadth-First Search on Intel Xeon Phi
”. Nicevt
,
Varshavaskoe shosse
,
Russia Moscow
2014
Corpus ID: 15033013
Breadth-First Search (BFS) is one of the most important kernels in graph computing. It is the main kernel of the Graph500 rating…
Expand
2013
2013
Strongly Indexable Graphs: Some New Perspectives
B. Acharya
,
P. Nagar
,
K. A. Germina
2013
Corpus ID: 124758909
Given any positive integer k , a ) , ( q p -graph ) , ( = E V G is strongly k -indexable if there exists a bijection
2012
2012
An Assesment of Rainfall and Temperature Variations in Selected Stations in Parts of Northern Nigeria
P. Adakayi
2012
Corpus ID: 130452660
A Thesis in the DEPARTMENT OF GEOGRAPHY AND PLANNING, Faculty of Environmental Sciences, Submitted to the School of Post…
Expand
2012
2012
Derived graphs of some graphs
S. Jog
,
S. P. Hande
,
I. Gutman
,
S. B. Bozkurt
2012
Corpus ID: 125625002
The derived graph of a simple graph G, denoted by G†, is the graph having the same vertex set as G, in which two vertices are…
Expand
2006
2006
A Linear-time Algorithm for Finding a Maximal Planar Subgraph *
H. Djidjev
2006
Corpus ID: 12789644
We construct an optimal linear-time algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph G…
Expand
1999
1999
Designing Effective Multi- Representational Learning Environments Table of Contents 1.0 Introduction 1 2.0 Functions of Multiple Representations 2 2.1 Different Information and Different Processes 2…
Shaaron E. Ainsworth
1999
Corpus ID: 8252611
ion has been defined in a number of different ways. One common sense of the term is as ‘subtraction’ where the emphasis is on…
Expand
1998
1998
Unimportance of the Surrounding Lattice in the Adsorption of CO on Low-Coordinated Mg Sites of MgO
A. Pelmenschikov
,
G. Morosi
,
A. Gamba
,
S. Coluccia
1998
Corpus ID: 73570366
The frequency shifts and binding energies of CO adsorbed on three-coordinated (3c) and four-coordinated (4c) Mg sites of MgO via…
Expand
1998
1998
Image retrieval using topological structure of user sketch
Sue J. Cho
,
S. Yoo
SMC'98 Conference Proceedings. IEEE…
1998
Corpus ID: 18008031
Content-based image retrieval system retrieves an image from a database using visual information. Among approaches to expressing…
Expand
1987
1987
Pancyclic and panconnected line graphs
A. Benhocine
,
J. Fouquet
Journal of Graph Theory
1987
Corpus ID: 11691293
Let G be a graph of order n ⩾ 3. We prove that if G is k-connected (k ⩾ 2) and the degree sum of k + 1 mutually independent…
Expand