Results 191 to 200 of about 5,251,465 (203)
Some of the next articles are maybe not open access.
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
Kirchhoff index in line, subdivision and total graphs of a regular graph
Discrete Applied Mathematics, 2012Xing Gao, Yanfeng Luo
exaly
The generalized connectivity of the line graph and the total graph for the complete bipartite graph
Applied Mathematics and Computation, 2019Yinkui Li
exaly
A C5-decomposition of the λ-fold line graph of the complete graph
Discrete Mathematics, 2019S Ganesamurthy
exaly
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics, 2008Hong-Jian Lai, Yehong Shao
exaly
Clique number of the square of a line graph
Discrete Mathematics, 2016Małgorzata Śleszyńska-Nowak
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
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory Series B, 2006Hong-Jian Lai, Hehui Wu, Yehong Shao
exaly