For any integer 𝑘 ≥ 2, a graph 𝐺 is called 𝑘-leaf-connected if |V(G)|≥k+1 and given any subset 𝑆 ⊆ 𝑉(𝐺) with |S|=k,G always has a spanning tree 𝑇 such that 𝑆 is precisely the set of leaves of ...
A set of novel vertex-degree-based invariants was introduced by Gutman, denoted by SO₁, SO₂, . . . , SO₆. These invariants were constructed through geometric reasoning based on a new graph invariant ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback