Results 291 to 300 of about 1,844,339 (310)
A clinical prediction model for blood pressure changes after renal denervation in patients with resistant hypertension. [PDF]
Front Cardiovasc MedZhang Y +9 more
europepmc +1 more source
On pancyclic line graphs [PDF]
Acta Mathematicae Applicatae Sinica, 1987 A graph with n vertices is pancyclic if it contains for every k, \(3\leq k\leq n,\) a circuit of length k. A graph is vertex pancyclic if every vertex is contained in a circuit of length k for every k, \(3\leq k\leq n\). In the paper are given some sufficient conditions for a graph which is a line graph of a finite graph G to be (vertex) pancyclic.
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1981
AbstractGeneralized line graphs extend the ideas of both line graphs and cocktail party graphs. They were originally motivated by spectral considerations. in this paper several (nonspectral) classical theorems about line graphs are extended to generalized line graphs, including the derivation and construction of the 31 minimal nongeneralized line ...
Michael Doob +2 more
openaire +3 more sources
AbstractGeneralized line graphs extend the ideas of both line graphs and cocktail party graphs. They were originally motivated by spectral considerations. in this paper several (nonspectral) classical theorems about line graphs are extended to generalized line graphs, including the derivation and construction of the 31 minimal nongeneralized line ...
Michael Doob +2 more
openaire +3 more sources
2021
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Jay S. Bagga, Lowell W. Beineke
openaire +2 more sources
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Jay S. Bagga, Lowell W. Beineke
openaire +2 more sources
Journal of Graph Theory, 1981
AbstractSufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.
Robert F. Shanny, Richard A. Brualdi
openaire +2 more sources
AbstractSufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.
Robert F. Shanny, Richard A. Brualdi
openaire +2 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
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.
openaire +3 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.
openaire +3 more sources