- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Dominating sets and domination polynomial of corona of graphs
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Only published works are available at libraries.
My notes
Similar books and articles
Novel Concepts on Domination in Neutrosophic Incidence Graphs with Some Applications.Florentin Smarandache, Siti Nurul Fitriah Mohamad & Roslan Hasni - 2023 - Journal of Advanced Computational Intelligence and Intelligent Informatics 27 (5).
The Domination Complexity and Related Extremal Values of Large 3D Torus.Zehui Shao, Jin Xu, S. M. Sheikholeslami & Shaohui Wang - 2018 - Complexity 2018:1-8.
A Note on Triple Repetition Sequence of Domination Number in Graphs.Leomarich Casinillo, Emily Casinillo & Lanndon Ocampo - 2022 - Inprime: Indonesian Journal of Pure and Applied Mathematics 4 (2):72-81.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.Fengwei Li, Xiaoyan Zhang, Qingfang Ye & Yuefang Sun - 2019 - Complexity 2019:1-8.
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs.Anuj Dawar, David Richerby & Benjamin Rossman - 2008 - Annals of Pure and Applied Logic 152 (1-3):31-50.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Strongly dominating sets of reals.Michal Dečo & Miroslav Repický - 2013 - Archive for Mathematical Logic 52 (7-8):827-846.
A Note on The Functions Which Are Not Polynomial Time Computable From Their Graphs.Asae Mochizuki & Juichi Shinoda - 1996 - Annals of the Japan Association for Philosophy of Science 9 (1):17-21.
Republicanism and Structural Domination.Rafeeq Hasan - 2021 - Pacific Philosophical Quarterly 102 (2):292-319.
Analytics
Added to PP
2022-09-01
Downloads
2 (#1,896,860)
6 months
2 (#1,691,363)
2022-09-01
Downloads
2 (#1,896,860)
6 months
2 (#1,691,363)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lxkd2 dc2