The following pages link to (Q5279754):
Displaying 12 items.
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- On Steiner degree distance of trees (Q1733411) (← links)
- On some degree-and-distance-based graph invariants of trees (Q1733617) (← links)
- Comparative study of distance-based graph invariants (Q2053092) (← links)
- Some degree and distance-based invariants of wreath products of graphs (Q2306582) (← links)
- New distance-based graph invariants and relations among them (Q2513547) (← links)
- The invariance principle for the total length of the nearest-neighbor graph (Q2576795) (← links)
- (Q4493164) (← links)
- (Q4529518) (← links)
- (Q5005660) (← links)
- (Q5158648) (← links)
- On relations between distance-based topological indices (Q6630953) (← links)