The following pages link to Henda C. Swart (Q233442):
Displayed 50 items.
- A note on extremal values of the scattering number (Q384905) (← links)
- The number of edges in a bipartite graph of given radius (Q533777) (← links)
- On the eccentric connectivity index of a graph (Q539884) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- Item:Q233442 (redirect page) (← links)
- A lower bound on the eccentric connectivity index of a graph (Q765366) (← links)
- Graphs for which all strong orientations are Eulerian (Q789400) (← links)
- On the degree distance of a graph (Q967319) (← links)
- The edge-Wiener index of a graph (Q1025981) (← links)
- Domination with exponential decay (Q1045130) (← links)
- Item:Q233442 (redirect page) (← links)
- Subplane replacement in projective planes (Q1161928) (← links)
- Principal common divisors of graphs (Q1209724) (← links)
- Spanning cycles of nearly cubic graphs (Q1250225) (← links)
- Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831) (← links)
- On the \(l\)-connectivity of a digraph (Q1322219) (← links)
- Steiner distance stable graphs (Q1336650) (← links)
- Distances between graphs under edge operations (Q1356416) (← links)
- The diversity of domination (Q1356420) (← links)
- Local edge domination critical graphs (Q1356421) (← links)
- Maximum and minimum toughness of graphs of small genus (Q1356471) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- On strong distances in oriented graphs (Q1810644) (← links)
- 2-3 graphs which have Vizing's adjacency property (Q1821113) (← links)
- Maximum sizes of graphs with given domination parameters (Q1827704) (← links)
- On \(n\)th order degree regular trees (Q1901617) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- Eccentric counts, connectivity and chordality (Q1941698) (← links)
- On equality in an upper bound for the restrained and total domination numbers of a graph (Q2461210) (← links)
- Diameter and inverse degree (Q2470432) (← links)
- Trees with equal domination and restrained domination numbers (Q2494314) (← links)
- (Q2706953) (← links)
- (Q2715998) (← links)
- (Q2721327) (← links)
- (Q2876021) (← links)
- On the eccentric connectivity index and Wiener index of a graph (Q2968605) (← links)
- Extremal regular graphs for the eccentric connectivity index (Q2968635) (← links)
- (Q3024734) (← links)
- (Q3033799) (← links)
- (Q3203049) (← links)
- ON α,β DESTRUCTIBLE GRAPHS (Q3333080) (← links)
- (Q3472139) (← links)
- (Q3474671) (← links)
- (Q3474678) (← links)
- (Q3490019) (← links)
- On the Toughness of a Graph (Q3490022) (← links)
- Bounds on a generalized domination parameter (Q3491607) (← links)
- Average Distance and Edge-Connectivity II (Q3544250) (← links)
- Average Distance and Edge-Connectivity I (Q3614196) (← links)