Steiner Domination Number of Splitting and Degree Splitting Graphs

S. K. Vaidya; Sejal H. Karkar

doi:10.5281/zenodo.3204316

ScienceGate Book Chapters

JOURNAL ARTICLE

Steiner Domination Number of Splitting and Degree Splitting Graphs

S. K. Vaidya Sejal H. Karkar

Year: 2019 Journal: Zenodo (CERN European Organization for Nuclear Research) Publisher: European Organization for Nuclear Research

DOI: 10.5281/zenodo.3204316

Get Full-Text PDF Get Analytical Report

Abstract

We consider simple, finite, connected and undirected graph G with vertex set V and edge set E. For the standard graph theoretic terminology and notation we follow Chatrand and Lesniak [2] while the terms related to the theory of domination are used in the sense of Haynes et al.[6].

Keywords:

Degree (music) Combinatorics Mathematics Domination analysis Graph Physics Vertex (graph theory)

Metrics

Cited By

0.21

FWCI (Field Weighted Citation Impact)

Refs

0.60

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Steiner Domination Number of Splitting and Degree Splitting Graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Steiner Domination Number of Splitting and Degree Splitting Graphs

Independent Domination Number of Certain Graphs and Their Degree Splitting Graphs

DOMINATION INTEGRITY OF SPLITTING AND DEGREE SPLITTING GRAPHS OF SOME GRAPHS

Zero forcing number of degree splitting graphs and complete degree splitting graphs

Global equitable domination in some degree splitting graphs