IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i12p1419-d577358.html
   My bibliography  Save this article

Figures of Graph Partitioning by Counting, Sequence and Layer Matrices

Author

Listed:
  • Mihaela Aurelia Tomescu

    (Department of Mathematics-Informatics, University of Petrosani, 332006 Petrosani, Romania)

  • Lorentz Jäntschi

    (Department of Physics and Chemistry, Technical University of Cluj-Napoca, 400641 Cluj-Napoca, Romania
    Chemical Doctoral School, Babes-Bolyai University, 400028 Cluj-Napoca, Romania)

  • Doina Iulia Rotaru

    (Department of Conservative Dentistry, “Iuliu Hatieganu” Medicine and Pharmacy University, 400349 Cluj-Napoca, Romania)

Abstract

A series of counting, sequence and layer matrices are considered precursors of classifiers capable of providing the partitions of the vertices of graphs. Classifiers are given to provide different degrees of distinctiveness for the vertices of the graphs. Any partition can be represented with colors. Following this fundamental idea, it was proposed to color the graphs according to the partitions of the graph vertices. Two alternative cases were identified: when the order of the sets in the partition is relevant (the sets are distinguished by their positions) and when the order of the sets in the partition is not relevant (the sets are not distinguished by their positions). The two isomers of C 28 fullerenes were colored to test the ability of classifiers to generate different partitions and colorings, thereby providing a useful visual tool for scientists working on the functionalization of various highly symmetrical chemical structures.

Suggested Citation

  • Mihaela Aurelia Tomescu & Lorentz Jäntschi & Doina Iulia Rotaru, 2021. "Figures of Graph Partitioning by Counting, Sequence and Layer Matrices," Mathematics, MDPI, vol. 9(12), pages 1-25, June.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1419-:d:577358
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/12/1419/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/12/1419/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hellmann, Tim, 2021. "Pairwise stable networks in homogeneous societies with weak link externalities," European Journal of Operational Research, Elsevier, vol. 291(3), pages 1164-1179.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chuan-Min Lee, 2023. "Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective," Mathematics, MDPI, vol. 11(15), pages 1-33, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peter-J. Jost, 2022. "Friend or foe? Co-opetition and entrepreneurial networking," Small Business Economics, Springer, vol. 59(3), pages 1043-1059, October.
    2. Ping Sun & Elena Parilina, 2024. "Dynamic Network Formation with Ordered Partitioning and Incomplete Information," Dynamic Games and Applications, Springer, vol. 14(4), pages 921-958, September.
    3. Tenev, Anastas P., 2024. "“Friends Are Thieves of Time”: Heuristic attention sharing in stable friendship networks," Journal of Economic Behavior & Organization, Elsevier, vol. 224(C), pages 785-809.
    4. Nizar Allouch & A. Meca & K. Polotskaya, 2021. "The Bonacich Shapley centrality," Studies in Economics 2106, School of Economics, University of Kent.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1419-:d:577358. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.