SOFT GRAPHS OF THE BARBELL STAR GRAPH
DOI:
https://doi.org/10.25077/jmua.14.4.366-375.2025Abstract
\textit{Let $G^*=(V(G^*),E(G^*))$ is a simple graph and $A$ be a non-empty set of parameter. Let $R\subseteq A\times V(G^*)$ be a arbitrary relation from $A$ to $V(G^*)$. A mapping $F:A\to P(V(G^*))$ can be defined as $F(x)=\left\{y\in V\mid xRy \right\}$ and a mapping $K:A\to P(E(G^*))$ can be defined as $K(x)=\left\{uv\in E\mid \left\{u,v\right\}\subseteq F(x)\right\}$. A pair $(F,A)$ and $(K,A)$ are soft sets over $V(G^*)$ and $E(G^*)$ respectively, then $(F(a),K(a))$ is a subgraph of $G^*$. The 4-tuple $G=(G^*,F,K,A)$ is called a soft graph of $G$. In this paper, we enumerate soft graph of amalgamation of path and star.}

References
[1] Zadeh, L. A., 1965, Fuzzy sets, Information and Control, 8(3): 338 – 353
[2] Molodtsov. D, 1999, Soft set theory—first results, Computers and Mathematics
With Applications, 37: 19 – 31
[3] Maji, P.K., Biswas, R., and Roy, A.R., 2003, Soft Set Theory, Computers and
Mathematics with Applications, 45: 555 – 562
[4] Ali, M. I., Feng, F., Liu, X., Min, M., Keun, W., and Shabir, 2009, On some new
operations in soft set theory, Computers and Mathematics with Applications,
57(9): 1547 – 1553
[5] Maji, P.K., Roy, A.R., Ranjan, A., and Biswas, R., 2002, An application of soft
sets in a decision making problem, Computers and Mathematics with Applica-
tions, 44(8-9): 1077 – 1083
[6] Maji, P.K., Biswas, R., and Roy, A.R., 2001, Fuzzy soft sets, Journal of Fuzzy
Mathematics, 9(3): 589 – 602
[7] Thumbakara, R.K., Rajesh and George, B., 2014, Soft graphs, General Mathe-
matics Notes, 21: 75 – 86
[8] Akram, M., and Nawaz, S., 2015, Operations on soft graphs, Fuzzy information
and Engineering, 7(4): 423 – 449
[9] Abbood, M.A., Al-Swidi, A.A.J., and Omran, A.A., 2019, Study of some graphs
types via. soft graph, Journal of Engineering and Applied Sciences, 14: 10375
– 10379
[10] Thenge, J.D., Reddy, B. S., and Jain, R.S., 2019, Contribution to soft graph
and soft tree, New Mathematics and Natural Computation 15(1): 129 – 143
[11] Thumbakara, R.K., Jose, J., and George, B., 2022, Hamiltonian soft graphs,
Ganita, 72(1): 145 – 151
[12] Palani, K., and Jones, T., 2020, Soft graphs of paths and cycle, Journal of
Maharaja Sayajirao University of Baroda, 54(1): 109 – 115
[13] K. Palani, Jones, T., and Maheswari, V., 2021, Soft graphs of certain graphs,
Journal of Physics: Conference Series, 1947(1) : 012045
[14] Bondy, J.A and Murty, U.S.R., 1976, Graph theory with applications, Elsevier
Science Publishing Co., Inc. New York
[15] Chartrand, G., Lesniak, L., and Zhang, P., 2016, Graph and digraph, 6th,
Ghapman and Hall/CRC, New York
[16] Fitriani, D., and Salman, A., 2016, Rainbow connection number of amalgama-
tion of some graphs, AKCE International Journal of Graphs and Combinatorics,
13(1): 90 – 99
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Departemen Matematika dan Sains Data FMIPA UNAND

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA license, users are free to:
- Share: Copy and redistribute the material in any medium or format.
- Adapt: Remix, transform, and build upon the material for any purpose, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â









