Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Fractional Star Domination Number of Graphs

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read More Add to Saved list
  • Additional Information
    • Publication Information:
      Zenodo
    • Publication Date:
      2024
    • Collection:
      Zenodo
    • Abstract:
      Objectives : Consider a graph is the connected, undirected graph. This study creates a new parameter named the Fractional Star Domination Number (FRSDN), which is denoted by to calculate the minimum weight with the star of all vertices of and the function values of all edges. Methods: This study evaluates the of some standard graphs and bounds by generalizing the value that is provided by the function value of an edges. Findings: This study evaluated on some standard graphs, such as paths, cycles, and the rooted product of paths and cycles. Finally, we obtain some bounds on for some general graphs, as well as the exactness value yielded by them. For any graph without isolated vertices, we have . Novelty: The new parameter FRSDN of is created by combining the fractional dominating function and the star dominating set. Keywords: Domination Number, Star Domination Number, Fractional Dominating Function, Fractional Domination Number, Fractional Star Domination Number
    • Relation:
      eissn:0974-5645; https://doi.org/10.17485/IJST/v17sp1.111; oai:zenodo.org:13847426
    • Accession Number:
      10.17485/IJST/v17sp1.111
    • Online Access:
      https://doi.org/10.17485/IJST/v17sp1.111
      https://indjst.org/articles/fractional-star-domination-number-of-graphs
    • Rights:
      info:eu-repo/semantics/openAccess ; Creative Commons Attribution 4.0 International ; https://creativecommons.org/licenses/by/4.0/legalcode
    • Accession Number:
      edsbas.3C6CE6B6