EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Rank of signed cacti

Zoran Stanić

American Journal of Combinatorics · 2023

DOI: 10.63151/amjc.v2i.13 ↗

Kurz gefasst

Fachartikel in der Zeitschrift American Journal of Combinatorics, 2023. Verfasst von Zoran Stanić. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A signed cactus \(\dot{G}\) is a connected signed graph such that every edge belongs to at most one cycle. The rank of \(\dot{G}\) is the rank of its adjacency matrix. In this paper we prove that \[\sum_{i=1}^k n_i-2k\leq \operatorname{rank}(\dot{G})\leq \sum_{i=1}^k n_i-2t +2 s,\] where \(k\) is the number of cycles in \(\dot{G}\), \(n_1, n_2, \ldots, n_k\) are their lengths, \(t\) is the number of cycles whose rank is their order minus two, and \(s\) is the number of edges outside cycles. Signed cacti attaining the lower bound are determined.

Zitieren

APA

Stanić, Z. (2023). Rank of signed cacti. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v2i.13

Vancouver

Stanić Z. Rank of signed cacti. American Journal of Combinatorics. 2023. doi:10.63151/amjc.v2i.13

BibTeX
@article{Stani2023,
  author = {Stanić, Zoran},
  title = {Rank of signed cacti},
  journal = {American Journal of Combinatorics},
  year = {2023},
  doi = {10.63151/amjc.v2i.13}
}
Kostenlos starten →