Results 41 to 50 of about 1,844,339 (310)
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
Characterization of Line-Consistent Signed Graphs
Discussiones Mathematicae Graph Theory, 2015 The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj +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
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
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
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
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
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions [PDF]
, 2017 In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph ...
Bryant, Darryn +2 more
core +1 more source
On two energy-like invariants of line graphs and related graph operations
Journal of Inequalities and Applications, 2016 For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues.
Xiaodan Chen, Yaoping Hou, Jingjian Li
doaj +1 more source
FoxO1 signaling in B cell malignancies and its therapeutic targeting
FEBS Letters, EarlyView.FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac +3 more
wiley +1 more source