• Login
    Search 
    •   UZ eScholar Home
    • Faculty of Science
    • Search
    •   UZ eScholar Home
    • Faculty of Science
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-6 of 6

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity 

    Fundikwa, Blessings T.; Mazorodze, Jaya P.; Mukwembi, Simon (HINDAWI, 2020-09-03)
    Graph theory is used to study the mathematical structures of pairwise relations among objects. Mathematically, a pair G=(V,E) is a crisp graph, where V is a nonempty set and E is a relation on V[1]. -e order of a graph G ...
    Thumbnail

    An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph 

    Fundikwa, Blessings T.; Mazorodze, Jaya P.; Mukwembi, Simon (HINDAWI, 2020-08-04)
    Let G=(V,E) be a finite, connected, undirected graph with vertex set V and edge set E. -e distance dG (u,v) between two vertices u, v of G is the length of a shortest u-v path in G.-e eccentricity ec(v)of a vertex v∈V is ...
    Thumbnail

    Spanning paths in graphs 

    Mafuta, Phillip; Mukwembi, Simon; Munyira, Sheunesu (Elsevier, 2018-08-29)
    The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLavi˜na, state that every simple connected graph G with minimum degree δ and leaf number L(G) such that δ ≥ 1 2 (L(G) + 1), is traceable. ...
    Thumbnail

    The Gutman Index and the Edge-Wiener Index of Graphs with given Vertex-Connectivity 

    Mazorodze, Jaya Percival; Mukwembi, Simon; Tomáš, Vetrík (University of Zielona Góra, 2015-12-30)
    The Gutman index and the edge-Wiener index have been extensively investigated particularly in the last decade. An important stream of re- search on graph indices is to bound indices in terms of the order and other parameters ...
    Thumbnail

    Average distance and edge-connectivity I 

    Dankelmann, Peter; Mukwembi, Simon; Swart, Henda C (Society for Industrial and Applied Mathematics, 2015-01-15)
    The average distance $\mu(G)$ of a connected graph G of order n is the average of the distances between all pairs of vertices of G. We prove that if G is a $\lambda$-edge-connected graph of order n, then the bounds $\mu(G) ...
    Thumbnail

    Minimum degree, leaf number and traceability 

    Mukwembi, Simon (Institute of Mathematics of the Czech Academy of Sciences, 2013-03-26)
    Let G be a finite connected graph with minimum degree δ. The leaf number L (G) of G is defined as the maximum number of leaf vertices contained in a spanning tree of G. We prove that if δ >12(L (G) + 1), then G is 2-connected. ...

    University of Zimbabwe: Educating To Change Lives!
    DSpace software copyright © 2002-2020  DuraSpace | Contact Us | Send Feedback
     

     

    Browse

    All of UZ eScholarCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Discover

    Author
    Mukwembi, Simon (6)
    Fundikwa, Blessings T. (2)Mazorodze, Jaya P. (2)Dankelmann, Peter (1)Mafuta, Phillip (1)Mazorodze, Jaya Percival (1)Munyira, Sheunesu (1)Swart, Henda C (1)Tomáš, Vetrík (1)Subjectleaf number (2)3-vertex-connected (1)C4-free graph (1)Connectivity measures (1)Edge-connectivity (1)edge-Wiener index (1)Graffiti.pc (1)graph (1)Graph parameters (1)Graph theory (1)... View MoreDate Issued2015 (2)2020 (2)2013 (1)2018 (1)Full TextFull Text (6)

    University of Zimbabwe: Educating To Change Lives!
    DSpace software copyright © 2002-2020  DuraSpace | Contact Us | Send Feedback