Results 281 to 290 of about 5,414,210 (302)
Some of the next articles are maybe not open access.
Mathematical Programming, 1978
Line-perfect graphs have been defined by L.E. Trotter as graphs whose line-graphs are perfect. They are characterized by the property of having no elementary odd cycle of size larger than 3. L.E. Trotter showed constructively that the maximum cardinality of a set of mutually non-adjacent edges (matching) is equal to the minimum cardinality of a ...
openaire +2 more sources
Line-perfect graphs have been defined by L.E. Trotter as graphs whose line-graphs are perfect. They are characterized by the property of having no elementary odd cycle of size larger than 3. L.E. Trotter showed constructively that the maximum cardinality of a set of mutually non-adjacent edges (matching) is equal to the minimum cardinality of a ...
openaire +2 more sources
Line Graph Neural Networks for Link Prediction
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Jie Wang, Jundong Li, Shuiwang Ji
exaly
1992
Following ideas of \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)] and using a previous result of his own in a submitted paper, the author proves: If \(G\) is a 3-edge connected simple triangle-free graph on \(n\) vertices with minimum degree \(\delta(G)\geq 4\) such that for the degrees the condition \((*)\) \(d(u)+ d(v)
openaire +1 more source
Following ideas of \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)] and using a previous result of his own in a submitted paper, the author proves: If \(G\) is a 3-edge connected simple triangle-free graph on \(n\) vertices with minimum degree \(\delta(G)\geq 4\) such that for the degrees the condition \((*)\) \(d(u)+ d(v)
openaire +1 more source
On the Zagreb indices of the line graphs of the subdivision graphs
Applied Mathematics and Computation, 2011Lokesha V
exaly
Spectra and energies of iterated line graphs of regular graphs
Applied Mathematics Letters, 2005Ivan Gutman, S B Rao
exaly
A Markovian Influence Graph Formed From Utility Line Outage Data to Mitigate Large Cascades
IEEE Transactions on Power Systems, 2020Ian Dobson +2 more
exaly
Bounding χ in terms of ω and Δ for quasi-line graphs
Journal of Graph Theory, 2008Andrew D. King
exaly
Topological indices of the line graph of subdivision graphs and their Schur-bounds
Applied Mathematics and Computation, 2015Guifu Su
exaly

