On sufficient conditions for k-leaf-connected graphs
From MaRDI portal
Publication:6646471
DOI10.3770/J.ISSN:2095-2651.2024.06.001MaRDI QIDQ6646471FDOQ6646471
Publication date: 2 December 2024
Published in: Journal of Mathematical Research with Applications (Search for Journal in Brave)
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Graph theory
- Note on Hamilton Circuits
- The first and second Zagreb indices of some graph operations
- Title not available (Why is that?)
- A method in graph theory
- Further properties of Zagreb indices
- On a spanning tree with specified leaves
- Zagreb indices of graphs
- Title not available (Why is that?)
- Some properties of the reformulated Zagreb indices
- On k-leaf-connected graphs
- Wiener-type invariants and \(k\)-leaf-connected graphs
- Improved sufficient conditions for \(k\)-leaf-connected graphs
- On a spanning tree with specified leaves in a bipartite graph
- A Fan-type condition for graphs to be \(k\)-leaf-connected
- An improvement of sufficient condition for \(k\)-leaf-connected graphs
- Some sufficient conditions for graphs being \(k\)-leaf-connected
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)
