Results 51 to 60 of about 5,977,266 (359)
The competition number of a generalized line graph is at most two
, 2012 In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one.
Park, Boram, Sano, Yoshio
core +3 more sources
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A. +2 more
core +1 more source
CMMSE 18: geometric-arithmetic index and line graph [PDF]
Journal of Mathematical Chemistry, 2019 The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $$GA_1$$GA1 and characterize ...
D. Pestana, J. M. Sigarreta, E. Tourís
semanticscholar +1 more source
Graphs isomorphic to subgraphs of their line-graphs
Discrete Mathematics, 1982 AbstractAn embedding of graph G into graph H is by defenition an isomorphism of G onto a subgraph of H. It is shown in this paper that every unicycle U embeds in its line-graph L(U), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle in a natural way.
Ralph Tindell, Douglas Bauer
openaire +3 more sources
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity [PDF]
, 2013 We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any \epsilon>0; finding
D. Dolev +18 more
core +3 more sources
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources
Graph equations for line graphs and total graphs
Discrete Mathematics, 1975 AbstractAll pairs (G,H) of graphs G,H satisfying L(G) = T(H) are determined. The “graph equation“ L(G)= T(H) is also solved.
Slobodan K. Simi, Dragos M. Cvetkovi
openaire +1 more source
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +1 more source
On the application of line graphs in quantitative structure-property studies [PDF]
Journal of the Serbian Chemical Society, 2000 Let G be a molecular graph possessing m0(G) edges. Let m1(G) be the number of edges of the line graph L(G) of G, known as the Bertz index. Let m2(G) be the number of edges of the line graph of L(G), etc.
Gutman Ivan, Tomović Željko
doaj +1 more source
On the line-connectivity of line-graphs
Mathematische Annalen, 1970 Throughout the paper, G will denote a finite undirected graph without loops or multiple lines. The line-graph L(G) of G is that graph whose point set can be put in one-to-one correspondence with the line set of G, such that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire +2 more sources