default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Mukwembi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Simon Mukwembi
:
Average distance, minimum degree, and irregularity index. Discret. Math. 347(1): 113671 (2024)- 2023
- [j33]Phillip Mafuta, Simon Mukwembi:
Average distance and connected domination. AKCE Int. J. Graphs Comb. 20(1): 61-64 (2023) - [j32]Phillip Mafuta, Simon Mukwembi, Bernardo Gabriel Rodrigues:
A note on connected domination number and leaf number. Discret. Math. 346(2): 113228 (2023) - 2020
- [j31]Blessings T. Fundikwa, Jaya Percival Mazorodze, Simon Mukwembi:
Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity. Int. J. Math. Math. Sci. 2020: 8982474:1-8982474:9 (2020)
2010 – 2019
- 2019
- [j30]Phillip Mafuta, Simon Mukwembi, Sheunesu Munyira:
Spanning paths in graphs. Discret. Appl. Math. 255: 278-282 (2019) - [j29]Peter Dankelmann, Fadekemi Janet Osaye, Simon Mukwembi, Bernardo Gabriel Rodrigues:
Upper bounds on the average eccentricity of K3-free and C4-free graphs. Discret. Appl. Math. 270: 106-114 (2019) - 2017
- [j28]Thebeth Rufaro Mukwembi, Simon Mukwembi:
Corruption and its detection: a graph-theoretic approach. Comput. Math. Organ. Theory 23(2): 293-300 (2017) - [j27]Phillip Mafuta, Simon Mukwembi:
On minimum degree, leaf number, traceability and Hamiltonicity in graphs. Discret. Appl. Math. 221: 89-94 (2017) - 2016
- [j26]Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík:
The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity. Discuss. Math. Graph Theory 36(4): 867-876 (2016) - 2014
- [j25]Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58: 376- (2014) - [j24]Patrick Ali, Simon Mukwembi, Sheunesu Munyira:
Degree distance and edge-connectivity. Australas. J Comb. 60: 50-68 (2014) - [j23]Peter Dankelmann, Simon Mukwembi:
Upper bounds on the average eccentricity. Discret. Appl. Math. 167: 72-79 (2014) - [j22]Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík:
On the Gutman index and minimum degree. Discret. Appl. Math. 173: 77-82 (2014) - [j21]Vivian Mukungunugwa, Simon Mukwembi:
On eccentric distance sum and minimum degree. Discret. Appl. Math. 175: 55-61 (2014) - [j20]Patrick Ali, Simon Mukwembi, Peter Dankelmann:
Steiner diameter of 3, 4 and 5-connected maximal planar graphs. Discret. Appl. Math. 179: 222-228 (2014) - [j19]Simon Mukwembi:
On size, radius and minimum degree. Discret. Math. Theor. Comput. Sci. 16(1): 1-6 (2014) - [j18]Simon Mukwembi:
Average Distance, Independence Number, and Spanning Trees. J. Graph Theory 76(3): 194-199 (2014) - 2013
- [j17]Simon Mukwembi:
On spanning cycles, paths and trees. Discret. Appl. Math. 161(13-14): 2217-2222 (2013) - [j16]Patrick Ali, Simon Mukwembi, Sheunesu Munyira:
Degree distance and vertex-connectivity. Discret. Appl. Math. 161(18): 2802-2811 (2013) - 2012
- [j15]Simon Mukwembi:
A note on diameter and the degree sequence of a graph. Appl. Math. Lett. 25(2): 175-178 (2012) - [j14]M. J. Morgan, Simon Mukwembi, Henda C. Swart:
A lower bound on the eccentric connectivity index of a graph. Discret. Appl. Math. 160(3): 248-258 (2012) - [j13]Patrick Ali, Peter Dankelmann, Simon Mukwembi:
Upper bounds on the Steiner diameter of a graph. Discret. Appl. Math. 160(12): 1845-1850 (2012) - [j12]Patrick Ali, Peter Dankelmann, Simon Mukwembi:
The radius of k-connected planar graphs with bounded faces. Discret. Math. 312(24): 3636-3642 (2012) - [j11]Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112(24): 944-947 (2012) - [j10]Peter Dankelmann, David Erwin, Simon Mukwembi, Bernardo Gabriel Rodrigues, Eric C. Mwambene, Gert Sabidussi:
Automorphism group and diameter of a graph. J. Graph Theory 70(1): 80-91 (2012) - 2011
- [j9]M. J. Morgan, Simon Mukwembi, Henda C. Swart:
On the eccentric connectivity index of a graph. Discret. Math. 311(13): 1229-1234 (2011) - 2010
- [j8]Simon Mukwembi:
On diameter and inverse degree of a graph. Discret. Math. 310(4): 940-946 (2010)
2000 – 2009
- 2009
- [j7]Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart:
On the degree distance of a graph. Discret. Appl. Math. 157(13): 2773-2777 (2009) - [j6]Michael A. Henning, Simon Mukwembi:
Domination, radius, and minimum degree. Discret. Appl. Math. 157(13): 2964-2968 (2009) - [j5]Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart:
The edge-Wiener index of a graph. Discret. Math. 309(10): 3452-3457 (2009) - [j4]Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart:
Domination with exponential decay. Discret. Math. 309(19): 5877-5883 (2009) - [j3]Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average distance and vertex-connectivity. J. Graph Theory 62(2): 157-177 (2009) - 2008
- [j2]Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average Distance and Edge-Connectivity II. SIAM J. Discret. Math. 21(4): 1035-1052 (2008) - [j1]Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average Distance and Edge-Connectivity I. SIAM J. Discret. Math. 22(1): 92-101 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
