On sufficient conditions for k-leaf-connected graphs
From MaRDI portal
Publication:6646471
Recommendations
- Some sufficient conditions for graphs to be \(k\)-leaf-connected
- An improvement of sufficient condition for \(k\)-leaf-connected graphs
- Improved sufficient conditions for \(k\)-leaf-connected graphs
- Sufficient conditions for \(k\)-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
- Some sufficient conditions for graphs being \(k\)-leaf-connected
Cites work
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 6756173 (Why is no real title available?)
- A Fan-type condition for graphs to be \(k\)-leaf-connected
- A method in graph theory
- An improvement of sufficient condition for \(k\)-leaf-connected graphs
- Further properties of Zagreb indices
- Graph theory
- Improved sufficient conditions for \(k\)-leaf-connected graphs
- Note on Hamilton Circuits
- On a spanning tree with specified leaves
- On a spanning tree with specified leaves in a bipartite graph
- On k-leaf-connected graphs
- Some properties of the reformulated Zagreb indices
- Some sufficient conditions for graphs being \(k\)-leaf-connected
- The first and second Zagreb indices of some graph operations
- Wiener-type invariants and \(k\)-leaf-connected graphs
- Zagreb indices of graphs
Cited in
(3)
This page was built for publication: On sufficient conditions for \(k\)-leaf-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646471)
