Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time

Weighted graphs in graph theory are created by weighing different values depending on the importance of connections or centers in a graph model. Networks can be modeled with graphs such that the devices and centers correspond to the vertices and connections correspond to the edges. In these networks...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Numerical methods for partial differential equations 2021-05, Vol.37 (3), p.2540-2549
Hauptverfasser: Aslan, Ersin, Tosun, Mehmet A.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!