QR Code

Non-inclusive and inclusive distance irregularity strength for the join product of graphs

<p class="p1"><span>A function </span><span class="math inline"><em>ϕ</em>: <em>V</em>(<em>G</em>)→{1, 2, …, <em>k</em>}</span><span> of a simple graph </span><span class="math inline"><em>G</em></span><span> is said to be a non-inclusive distance vertex irregular </span><span class="math inline"><e...

Whakaahuatanga katoa

I tiakina i:
Ngā taipitopito rārangi puna kōrero
Ngā kaituhi matua: Faisal Susanto, Kristiana Wijaya, I Wayan Sudarsana, Slamin Slamin
Hōputu: Artigo
Reo:Inglês
I whakaputaina: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-03-01
Rangatū:Electronic Journal of Graph Theory and Applications
Ngā marau:
Urunga tuihono:http://www.ejgta.org/index.php/ejgta/article/view/1297
Ngā Tūtohu: Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!