EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Connectivity of Networks Modeled by Weighted Graphs

Pedro García-Vázquez

Axioms · 26.06.2026 · 15 (7) · 481

DOI: 10.3390/axioms15070481 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Axioms, online erschienen am 26.06.2026. Verfasst von Pedro García-Vázquez. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Junta de Andalucía.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph G=(V,E) together with two positive real-valued weight-functions wV:V→R>0 and wE:E→R>0 is called a weighted graph and is denoted by (G;wV;wE). In this paper, we introduce the concepts of connectivity, edge-connectivity, and restricted edge-connectivity for a weighted graph (G;wV;wE), and we prove general bounds analogous to those in the unweighted case. Furthermore, we study the connectivity and edge-connectivity of the line graph and the P2-path graph of a weighted graph, establishing upper and lower bounds for each of these parameters.

Förderung

  • Junta de Andalucía

Zitieren

APA

García-Vázquez, P. (2026). Connectivity of Networks Modeled by Weighted Graphs. Axioms, 15(7), 481. https://doi.org/10.3390/axioms15070481

Vancouver

García-Vázquez P. Connectivity of Networks Modeled by Weighted Graphs. Axioms. 2026;15(7):481. doi:10.3390/axioms15070481

BibTeX
@article{GarcaVzquez2026,
  author = {García-Vázquez, Pedro},
  title = {Connectivity of Networks Modeled by Weighted Graphs},
  journal = {Axioms},
  year = {2026},
  volume = {15},
  number = {7},
  pages = {481},
  doi = {10.3390/axioms15070481}
}
Kostenlos starten →