Mostrando 2 resultados de: 2
On H-irregularity strengths of G-amalgamation of graphs
ArticleAbstract: A simple graph G = (V (G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one sPalabras claves:Amalgamation of graphs, Edge) H-irregular labeling, Edge) H-irregularity strength, Total (vertexAutores:Ashraf F., Martin Bača, Semaničova-Fenovciková A., Shabbir A.Fuentes:scopusTotal Irregularity Strengths of a Disjoint Union of (4,6)-Fullerene Graphs
ArticleAbstract: A fullerene is a polyhedral molecule made entirely of carbon atoms other than graphite and diamond.Palabras claves:(4,6)-Fullerene, Irregularity strength, total edge irregularity strength, total vertex irregularity strengthAutores:Martin Bača, Semaničova-Fenovciková A., Shabbir A.Fuentes:scopus