EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Locally Irregular-Connected Graphs

Gary Chartrand, Ping Zhang

Mathematics · 25.05.2026 · 14 (11) · 1827

DOI: 10.3390/math14111827 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 25.05.2026. Verfasst von Gary Chartrand und 1 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph G is locally irregular if every two adjacent vertices have distinct degrees and is locally irregular-connected if for every two vertices u and v of G, there is a locally irregular u−v path in G. For a finite set S of two or more positive integers with maximum element k, it is known that there exists a graph of order k+1 with degree set S. This result is extended by showing that there is a locally irregular-connected graph of order k+1 with degree set S. Characterizations are established for all locally irregular-connected graphs of cycle rank at most 2. All sets S of positive integers are determined for which there is a locally irregular-connected graph of cycle rank at most 2 with degree set S. The minimum order of a locally irregular-connected graph with a prescribed degree set is determined as well. Other results and open questions are also presented.

Zitieren

APA

Chartrand, G., & Zhang, P. (2026). Locally Irregular-Connected Graphs. Mathematics, 14(11), 1827. https://doi.org/10.3390/math14111827

Vancouver

Chartrand G, Zhang P. Locally Irregular-Connected Graphs. Mathematics. 2026;14(11):1827. doi:10.3390/math14111827

BibTeX
@article{Chartrand2026,
  author = {Chartrand, Gary and Zhang, Ping},
  title = {Locally Irregular-Connected Graphs},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {11},
  pages = {1827},
  doi = {10.3390/math14111827}
}
Kostenlos starten →