EUVIMEDEUVIMED entdecken
Crossref

Further results on edge irregularity strength of graphs

Muhammad Imran, Adnan Aslam, Sohail Zafar, Waqas Nazeer

Indonesian Journal of Combinatorics · 2017

DOI: 10.19184/ijc.2017.1.2.5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2017. Verfasst von Muhammad Imran und 3 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A vertex $k$-labelling $\phi:V(G)\longrightarrow \{1,2,\ldots,k\}$ is called irregular $k$-labeling of the graph $G$ if for every two different edges $e$ and $f$, there is $w_{\phi}(e)\neq w_{\phi}(f)$; where the weight of an edge is given by $e=xy\in E(G)$ is $w_{\phi}(xy)=\phi(x)+\phi(y)$. The minimum $k$ for which the graph $G$ has an edge irregular $k$-labelling is called \emph{edge irregularity strength} of $G$, denoted by $es(G)$.\\

In the paper, we determine the exact value of the edge irregularity strength of caterpillars, $n$-star graphs, $(n,t)$-kite graphs, cycle chains and friendship graphs.

Zitieren

APA

Imran, M., Aslam, A., Zafar, S., & Nazeer, W. (2017). Further results on edge irregularity strength of graphs. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2017.1.2.5

Vancouver

Imran M, Aslam A, Zafar S, Nazeer W. Further results on edge irregularity strength of graphs. Indonesian Journal of Combinatorics. 2017. doi:10.19184/ijc.2017.1.2.5

BibTeX
@article{Imran2017,
  author = {Imran, Muhammad and Aslam, Adnan and Zafar, Sohail and Nazeer, Waqas},
  title = {Further results on edge irregularity strength of graphs},
  journal = {Indonesian Journal of Combinatorics},
  year = {2017},
  doi = {10.19184/ijc.2017.1.2.5}
}
Kostenlos starten →