OpenAlex
On graphs whose graphoidal domination number is one
Work
Year: 2015
Type: article
Abstract: Given a graph , a set of non-trivial paths, which are not necessarily open, called -edges, is called a graphoidal cover of if it satisfies the following conditions: Every vertex of is an internal vert... more
Source: AKCE International Journal of Graphs and Combinatorics
Authors B. D. Acharya, Purnima Gupta, Deepti Jain
Institutions Karnatak University, Institute of Mathematical Sciences, University of Delhi
Cites: 7
Cited by: 3
Related to: 10
FWCI: 0.774
Citation percentile (by year/subfield): 49.56
Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
APC paid (est): $1,226