QR-koodi

Weak edge triangle free detour number of a graph

<p class="p1"><span>For any two vertices </span><span class="math inline"><em>u</em></span><span> and </span><span class="math inline"><em>v</em></span><span> in a connected graph </span><span class="math inline"><em>G</em> = (<em>V</em>, <em>E</em>),</span><span> a </span><span class="math inline">...

Täydet tiedot

Tallennettuna:
Päätekijät: Sethu Ramalingam, S. Athisayanathan
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-10-01
Sarja:Electronic Journal of Graph Theory and Applications
Aiheet:
triangle free detour distance, triangle free detour number, weak edge triangle free detour set, weak edge triangle free detour number
Linkit:http://www.ejgta.org/index.php/ejgta/article/view/1187
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!

Samankaltaisia teoksia