2025-02-23T06:15:18-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-126%22&qt=morelikethis&rows=5
2025-02-23T06:15:18-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-126%22&qt=morelikethis&rows=5
2025-02-23T06:15:18-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T06:15:18-05:00 DEBUG: Deserialized SOLR response
Global outer connected domination number of a graph
For a given graph \(G=(V,E)\), a dominating set \(D \subseteq V(G)\) is said to be an outer connected dominating set if \(D=V(G)\) or \(G-D\) is connected. The outer connected domination number of a graph \(G\), denoted by \(\widetilde{\gamma}_c(G)\), is the cardinality of a minimum outer connected...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Lugansk National Taras Shevchenko University
2018
|
Subjects: | |
Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/126 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!