Degree distance and vertex-connectivity
From MaRDI portal
Publication:2446871
DOI10.1016/J.DAM.2013.06.033zbMATH Open1287.05075OpenAlexW2024002336MaRDI QIDQ2446871FDOQ2446871
Authors: Simon Mukwembi, Patrick Ali, S. Munyira 
Publication date: 23 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.033
Recommendations
Cites Work
- The minimum degree distance of graphs of given order and size
- Some extremal properties of the degree distance of a graph
- Unicyclic and bicyclic graphs having minimum degree distance
- Degree distance of unicyclic and bicyclic graphs
- Title not available (Why is that?)
- On the degree distance of a graph
- A NOTE ON TRICYCLIC GRAPHS WITH MINIMUM DEGREE DISTANCE
- Calculating the degree distance of partial Hamming graphs
- Degree distance and minimum degree
- Maximum degree distance of graphs with exactly two cycles
Cited In (14)
- On some degree-and-distance-based graph invariants of trees
- Degree distance and minimum degree
- On the degree distance of a graph
- General degree distance of graphs
- On eccentric connectivity index and connectivity
- The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
- Degree Distance in Graphs with Forbidden Subgraphs
- The degree resistance distance of cacti
- Gutman index of some derived graphs
- Status connectivity indices of line graphs
- Degree resistance distance of trees with some given parameters
- Distance degrees of vertex-transitive graphs
- Title not available (Why is that?)
- On Steiner degree distance of trees
This page was built for publication: Degree distance and vertex-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446871)
