Results 261 to 270 of about 5,414,210 (302)
Outerplanarity of line graphs and iterated line graphs
Applied Mathematics Letters, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weihua Yang, Huiqiu Lin, Jinlong Shu
exaly +3 more sources
ILIGRA: An Efficient Inverse Line Graph Algorithm [PDF]
Mathematical Modelling and Algorithms, 2014 This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H.
Piet van Mieghem
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohong Niu, Liming Xiong
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohong Niu, Liming Xiong
openaire +3 more sources
Collapsible Graphs and Hamiltonicity of Line Graphs
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Weihua +3 more
openaire +4 more sources
Graphs and Combinatorics, 1994
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Van Bang Le, Erich Prisner
openaire +2 more sources
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Van Bang Le, Erich Prisner
openaire +2 more sources
Discrete Mathematics, 2022
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Yingmin Shangguan, Liming Xiong
openaire +2 more sources
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Yingmin Shangguan, Liming Xiong
openaire +2 more sources
Pattern Recognition Letters, 1993
The author defines and studies the concept of a fuzzy line graph of a fuzzy graph. The necessary and sufficient conditions for a fuzzy graph to be isomorphic to its corresponding fuzzy line graph are given. Also established is a necessary and sufficient condition for a fuzzy graph to be a fuzzy line graph of a fuzzy graph.
exaly +4 more sources
The author defines and studies the concept of a fuzzy line graph of a fuzzy graph. The necessary and sufficient conditions for a fuzzy graph to be isomorphic to its corresponding fuzzy line graph are given. Also established is a necessary and sufficient condition for a fuzzy graph to be a fuzzy line graph of a fuzzy graph.
exaly +4 more sources
Mathematical Programming, 1977
The concept of line perfection of a graph is defined so that a simple graph is line perfect if and only if its line graph is perfect in the usual sense. Line perfect graphs are characterized as those which contain no odd cycles of size larger than 3.
L E Trotter
exaly +3 more sources
The concept of line perfection of a graph is defined so that a simple graph is line perfect if and only if its line graph is perfect in the usual sense. Line perfect graphs are characterized as those which contain no odd cycles of size larger than 3.
L E Trotter
exaly +3 more sources
Journal of Graph Theory, 1984
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +3 more sources
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +3 more sources