Results 91 to 100 of about 1,939,159 (235)
Graphs with odd and even distances between non-cut vertices [PDF]
Opuscula MathematicaWe prove that in a connected graph, the distances between non-cut vertices are odd if and only if it is the line graph of a strong unique independence tree.
Kateryna Antoshyna, Sergiy Kozerenko
doaj +1 more source
Towards on-line Ohba's conjecture [PDF]
, 2012 The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is strictly larger for some graphs. In particular, there are graphs $G$ with $|V(G)
Kozik, Jakub, Micek, Piotr, Zhu, Xuding
core
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
ncRPI-LGAT: Prediction of ncRNA-protein interactions with line graph attention network framework. [PDF]
Comput Struct Biotechnol J, 2023 Han Y, Zhang SW.
europepmc +1 more source
On the line graph of the square and the square of the line graph of a connected graph [PDF]
, 1973 Ladislav Nebeský
openalex +1 more source
Molecular graph contrastive learning with line graph
Pattern RecognitionTrapped by the label scarcity in molecular property prediction and drug design, graph contrastive learning (GCL) came forward. Leading contrastive learning works show two kinds of view generators, that is, random or learnable data corruption and domain knowledge incorporation.
Xueyuan Chen +6 more
openaire +2 more sources
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs
AKCE International Journal of Graphs and Combinatorics, 2019 The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph of size is the maximum number of odd cycles in such a cycle decomposition is and is
R. Rajarajachozhan, R. Sampathkumar
doaj +1 more source
Projective dimension and regularity of the path ideal of the line graph [PDF]
, 2016 Guangjun Zhu
openalex +1 more source
Computing Topological Indices and Polynomials for Line Graphs
Mathematics, 2018 A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections. All the more vital topological indices correspond to certain physico-concoction properties like breaking point ...
Shahid Imran +3 more
doaj +1 more source