Patriarchy Family Tree Graph from Tiv to Kumator (Seember)
DOI:
https://doi.org/10.62054/ijdm/0204.09Keywords:
Graph theory, Family tree, Graph coloring, Dsatur algorithm, Graph connectivityAbstract
Tree graphs, as acyclic and connected structures, provide a framework for modelling hierarchical relationships, such as genealogical lineages. This study constructs and analyzes a patriarchal family tree of the Tiv ethnic group, tracing lineage from Tiv to Kumator, through the application of the Dsatur graph coloring algorithm. Each vertex represents an individual, while edges denote parent–child relationships, forming an acyclic connected graph. By implementing Dsatur, optimal vertex coloring was achieved such that no two adjacent vertices share the same color, confirming the tree’s bipartite nature. The resulting family tree revealed a chromatic number of two, consistent with theoretical predictions for acyclic graphs, and a longest lineage path of fifteen generations. Aside from establishing structural relationships, the model determines how patriarchal lineage rules influence genealogical continuity, illustrating where dynastic extensions cease due to the absence of male descendants.
References
Ade, M. A. (2014): Application of geographic information systems in land suitability rating for lowland rice production in Benue State. Ethiopian Journal of Environmental Studies and Management, 7(2), 695-708. doi:oi.org/10.4314/ejesm.v7i1.1S
Anellis, I. H. and Abeles, F. F. (2016): The historical sources of tree graphs and the tree method in the work of Peirce and Gentzen Modern Logic 1850-1950, East and West (pp. 35-97): Springer.
Arumugam, S., Brandstädt, A., Nishizeki, T. and Thulasiraman, K. (2016): Handbook of graph theory, combinatorial optimization, and algorithms: Chapman and Hall/CRC.
Babarinsa, O. (2022): Graph theory: A lost component for development in Nigeria. Journal of the Nigerian Society of Physical Sciences, 4(3), 844-851. doi:10.46481/jnsps.2022.874
Babarinsa, O. and Kamarulhaili, H.. (2019): Mixed Energy of a Mixed Hourglass Graph. Communications in Mathematics and Applications, 10(1), 45-53. doi:DOI: 10.26713/cma.v10i1.1143
Diestel, R. (2025): Graph theory (Vol. 173): Springer Nature.
Elgot, C. C, Bloom, S. L. and Tindell, R. (1978): On the algebraic structure of rooted trees Selected Papers (pp. 236-273): Springer.
Galitsky, B.. (2013): Machine learning of syntactic parse trees for search and classification of text. Engineering Applications of Artificial Intelligence, 26(3), 1072-1091.
Hussain, S and Islam O. (2007): An energy efficient spanning tree based multi-hop routing in wireless sensor networks. Paper presented at the 2007 IEEE Wireless Communications and Networking Conference.
Klapisch-Zuber, C. (1991): The genesis of the family tree. I Tatti Studies in the Italian Renaissance, 4, 105-129.
Klawitter, J. (2020): Spaces of phylogenetic networks. University of Auckland.
Malaguti, E. and Toth, P. (2010): A survey on vertex coloring problems. International transactions in operational research, 17(1), 1-34.
Marcus, D. A. (2020): Graph theory (Vol. 53): American Mathematical Soc.
Medjedovic, D. and Tahirovic, E. (2022): Algorithms and data structures for massive datasets: Simon and Schuster.
Mömke, T., P.opa, A., Roshany-Tabrizi, A., Ruderer, M., and Vincze, R. (2025): Approximating maximum edge 2-coloring by normalizing graphs. Discrete Mathematics and Theoretical Computer Science, 27(2). 1-24.
Rahman, M. (2017): Basic graph theory (Vol. 1): Springer.
Tuza, Z. (1997): Graph colorings with local constraints-a survey. Discussiones Mathematicae Graph Theory, 17(2), 161-228.
Valiente, G. (2002): Algorithms on trees and graphs (Vol. 112). Germany: Springer.
Vasudev, C. (2006): Graph theory with applications: New Age International.
Wang, H. (2014): The distances between internal vertices and leaves of a tree. European Journal of Combinatorics, 41, 79-99.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Babarinsa Olayiwola, Ngule S. Sandra (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors are solely responsible for obtaining permission to reproduce any copyrighted material contained in the manuscript as submitted. Any instance of possible prior publication in any form must be disclosed at the time the manuscript is submitted and a
copy or link to the publication must be provided.
The Journal articles are open access and are distributed under the terms of the Creative
Commons Attribution-NonCommercial-NoDerivs 4.0 IGO License, which permits use,
distribution, and reproduction in any medium, provided the original work is properly cited.
No modifications or commercial use of the articles are permitted.
