On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs

Susanti, Yeni; Puspitasari, Y. I.; Khotimah, Husnul

doi:10.29252/ijmsi.15.1.1

Cited by 9 publications

(13 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Each of the cells in the subplots could represent same type, or different types of plots. For instance, one could visualize a singular set of data as a graph [19], a bar chart [20], a pie chart [21], a scatter diagram [22], among others, all within the subplot. A sample grid architecture [23] for a subplot is shown in Fig.…”

Section: Sub-plot Generationmentioning

confidence: 99%

Program-Based Construction of Scientific Visualization

Eze¹,

Okunbor²,

Samuel³

et al. 2021

World J. Adv. Res. Rev.

View full text Add to dashboard Cite

Scientific Visualization remains an integral and inevitable part of every meaningful scientific, industrial and academic research. The focus of this study is to demystify the evolution, design and programmatic construction of scientific visualizations. Real life demonstrations have been achieved in this work using Python Programming Language. This work begins by exploring the programming environment based on a Python Integrated Development Environment (IDE) – the Anaconda. The IDE usage was shown in a chronological sequence with accompanying visual outcomes. The use of plot libraries was discussed, and implemented in real life. One of the demonstration projects is the Zig-Zag plot. Studies were also done on sub-plotting, and how it is used in scientific visualizations, especially where there is necessity to generate variations of outputs originating from a singular dataset. The work also explores the use of pie charts for presentations. A real-life case of how this could be used to visualize the halls of a residential university was demonstrated, with each of the data components labelled in distinct colours. It is hoped that this work will serve as a foothold and useful guide to researchers and other practitioners involved in real life scientific visualization.

show abstract

Section: Sub-plot Generationmentioning

confidence: 99%

Program-Based Construction of Scientific Visualization

Eze¹,

Okunbor²,

Samuel³

et al. 2021

World J. Adv. Res. Rev.

View full text Add to dashboard Cite

show abstract

“…[3] meneliti tes graf web dan graf-graf terkait, Putra dan Susanti [7] meneliti graf theta seragam terpusat, dan Susanti dkk. [8] meneliti graf staircase dan graf-graf terkait. Selain itu, untuk melihat graf-graf yang telah dibuktikan nilai kekuatan total tak reguler sisinya, dapat dilihat pada survey yang dilakukan oleh Gallian [2].…”

Section: Pendahuluanunclassified

Kekuatan Total Tak Reguler Sisi Graf Double Fan Dan Graf-Graf Terkait Graf Double Fan

Khotimah

Susanti

2019

JMT

View full text Add to dashboard Cite

Pelabelan graf adalah pemetaan yang membawa elemen-elemen graf ke suatu bilangan (biasanya bilangan bulat positif atau bilangan bulat non-negatif). Misalkan $G$ adalah suatu graf sederhana, terhubung, dan tidak berarah. Graf $G$ dapat ditulis dengan $G=(V(G),E(G))$ dimana $V(G)$ merupakan himpunan titik tak kosong dan $E(G)$ merupakan himpunan sisi. Pemetaan $f:V(G)\cup E(G) \longrightarrow \{1,2,\ldots,k\}$, untuk suatu bilangan bulat $k$, disebut dengan pelabelan-$k$ total tak reguler sisi jika setiap dua sisi $e_1$ dan $e_2$ yang berbeda, memiliki bobot sisi berbeda, yakni $wt_f(e_1)\neq wt_f(e_2)$. Suatu $k$ minimum sedemikian hingga $G$ mempunyai pelabelan-$k$ total tak reguler sisi, disimbolkan dengan $tes(G)$ dan disebut dengan kekuatan total tak reguler sisi graf $G$. Pada \textit{paper} ini, akan diberikan nilai dari kekuatan total tak regular sisi graf \textit{double fan} dan graf-graf yang terkait dengan graf \textit{double fan}, yakni graf \textit{double fan snake}, graf parasut diperumum, dan graf karosel.

show abstract

“…Meanwhile in [5] it is given the tes for some double fan related graphs. In [11] it is given the tes of some staircase graphs including mirror-staircase and double staircase graphs. In this paper, we consider particular arithmetic staircase graphs, namely odd staircase graphs and even staircase graphs and give the exact value of their total edge irregularity strengths.…”

Section: Introductionmentioning

confidence: 99%

On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs

Susanti¹,

Haq²

2022

Preprint

View full text Add to dashboard Cite

A total $m$-labelling $\alpha$ on graph $\Gamma$ is called an edge irregular total $m$-labelling if for any two different edges of $\Gamma$, their weights respect to $\alpha$ are distinct, where the weight of any edge is defined as the sum of its label and the labels of its end vertices. We determine the minimum $m$ such that $\Gamma$ can be labelled by an edge irregular total $m$-labelling whenever $\Gamma$ is an odd staircase graph or an even staircase graph.

show abstract

On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs

Cited by 9 publications

References 10 publications

Program-Based Construction of Scientific Visualization

Program-Based Construction of Scientific Visualization

Kekuatan Total Tak Reguler Sisi Graf Double Fan Dan Graf-Graf Terkait Graf Double Fan

On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs

Contact Info

Product

Resources

About