Forcing total outer connected monophonic number of a graph
For a connected graph $G = (V,E)$ of order at least two, a subset $T$ of a minimum total outer connected monophonic set $S$ of $G$ is a forcing total outer connected monophonic subset for $S$ if $S$ is the unique minimum total outer connected monophonic set containing $T$. A forcing total outer...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Saratov State University
2022-08-01
|
| シリーズ: | Известия Саратовского университета. Новая серия: Математика. Механика. Информатика |
| 主題: | |
| オンライン･アクセス: | https://mmi.sgu.ru/sites/mmi.sgu.ru/files/text-pdf/2022/08/278-286-ganesamoorthy-lakshmy_priya.pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|