EUVIMEDEUVIMED entdecken
Crossref

Maximizing adjacency determinant over k -cyclic graphs with a unique perfect matching: A complete characterization

Kuldeep Sarma

Discrete Applied Mathematics · 2026-07 · 387 · 172-180

DOI: 10.1016/j.dam.2026.03.010 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Kuldeep Sarma. Die Arbeit nennt 29 Literaturangaben. Gefördert von: Indian Institute of Science, National Board for Higher Mathematics.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Indian Institute of Science
  • National Board for Higher Mathematics

Zitieren

APA

Sarma, K. (2026). Maximizing adjacency determinant over k -cyclic graphs with a unique perfect matching: A complete characterization. Discrete Applied Mathematics, 387, 172-180. https://doi.org/10.1016/j.dam.2026.03.010

Vancouver

Sarma K. Maximizing adjacency determinant over k -cyclic graphs with a unique perfect matching: A complete characterization. Discrete Applied Mathematics. 2026;387:172-180. doi:10.1016/j.dam.2026.03.010

BibTeX
@article{Sarma2026,
  author = {Sarma, Kuldeep},
  title = {Maximizing adjacency determinant over k -cyclic graphs with a unique perfect matching: A complete characterization},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  volume = {387},
  pages = {172--180},
  doi = {10.1016/j.dam.2026.03.010}
}
Kostenlos starten →