The Monophonic-triangular Number of a Graph
Ars Combinatoria · 2024
DOI: 10.61091/ars-160-11 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, 2024. Verfasst von G.Princeton Lazarus und 2 weiteren Autor:innen.
Abstract (Originalsprache)
A path \(x_1, x_2, \dots, x_n\) in a connected graph \( G \) that has no edge \( x_i x_j \) \((j \geq i+3)\) is called a monophonic-triangular path or mt-path. A non-empty subset \( M \) of \( V(G) \) is a monophonic-triangular set or mt-set of \( G \) if every member in \( V(G) \) exists in a mt-path joining some pair of members in \( M \). The monophonic-triangular number or mt-number is the lowest cardinality of an mt-set of \( G \) and it is symbolized by \( mt(G) \). The general properties satisfied by mt-sets are discussed. Also, we establish \( mt \)-number boundaries and discover similar results for a few common graphs. Graphs \( G \) of order \( p \) with \( mt(G) = p \), \( p – 1 \), or \( p – 2 \) are characterized.
Zitieren
APA
Lazarus, G., Selvakumar, K., & Titus, P. (2024). The Monophonic-triangular Number of a Graph. Ars Combinatoria. https://doi.org/10.61091/ars-160-11
Vancouver
Lazarus G, Selvakumar K, Titus P. The Monophonic-triangular Number of a Graph. Ars Combinatoria. 2024. doi:10.61091/ars-160-11
BibTeX
@article{Lazarus2024,
author = {Lazarus, G.Princeton and Selvakumar, K. and Titus, P.},
title = {The Monophonic-triangular Number of a Graph},
journal = {Ars Combinatoria},
year = {2024},
doi = {10.61091/ars-160-11}
}
EUVIMED