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.}

Downloads
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
How to Cite
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 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.
Copyright Holder
The copyright of 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), in accordance with the journal's stated copyright policy.
Author Rights
Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:
-
Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.
-
Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.
-
Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.
Creative Commons License (CC BY-SA 4.0)
Under the CC BY-SA 4.0 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, including commercial purposes.
These permissions are subject to the following conditions:
-
Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.
-
ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.
-
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.
For more information about the CC BY-SA 4.0 license, please visit:
https://creativecommons.org/licenses/by-sa/4.0/
Third-Party Content
Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.
Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.
Copyright and Licensing Information
Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.



