ARTICLE | doi:10.20944/preprints202201.0145.v1
Subject: Computer Science And Mathematics, Applied Mathematics Keywords: Coloring Numbers; Resolving Numbers; Dominating Numbers
Online: 11 January 2022 (13:43:56 CET)
New setting is introduced to study “closing numbers” and “super-closing numbers” as optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. In this way, some approaches are applied to get some sets from (Neutrosophic)n-SuperHyperGraph and after that, some ideas are applied to get different types of super-closing numbers which are called by optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. The notion of dual is another new idea which is covered by these notions and results. In the setting of dual, the set of super-vertices is exchanged with the set of super-edges. Thus these results and definitions hold in the setting of dual. Setting of neutrosophic n-SuperHyperGraph is used to get some examples and solutions for two applications which are proposed. Both setting of SuperHyperGraph and neutrosophic n-SuperHyperGraph are simultaneously studied but the results are about the setting of n-SuperHyperGraphs. Setting of neutrosophic n-SuperHyperGraph get some examples where neutrosophic hypergraphs as special case of neutrosophic n-SuperHyperGraph are used. The clarifications use neutrosophic n-SuperHyperGraph and theoretical study is to use n-SuperHyperGraph but these results are also applicable into neutrosophic n-SuperHyperGraph. Special usage from different attributes of neutrosophic n-SuperHyperGraph are appropriate to have open ways to pursue this study. Different types of procedures including optimal-super-set, and optimal-super-number alongside study on the family of (neutrosophic)n-SuperHyperGraph are proposed in this way, some results are obtained. General classes of (neutrosophic)n-SuperHyperGraph are used to obtains these closing numbers and super-closing numbers and the representatives of the optimal-super-coloring sets, optimal-super-dominating sets and optimal-super-resolving sets. Using colors to assign to the super-vertices of n-SuperHyperGraph and characterizing optimal-super-resolving sets and optimal-super-dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on n-SuperHyperGraph to get new results about closing numbers and super-closing numbers alongside sets in the way that some closing numbers super-closing numbers get understandable perspective. Family of n-SuperHyperGraph are studied to investigate about the notions, super-resolving and super-coloring alongside super-dominating in n-SuperHyperGraph. In this way, sets of representatives of optimal-super-colors, optimal-super-resolving sets and optimal-super-dominating sets have key role. Optimal-super sets and optimal-super numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal-super ones. Simultaneously, three notions are applied into (neutrosophic)n-SuperHyperGraph to get sensible results about their structures. Basic familiarities with n-SuperHyperGraph theory and neutrosophic n-SuperHyperGraph theory are proposed for this article.
ARTICLE | doi:10.20944/preprints202205.0065.v1
Subject: Business, Economics And Management, Economics Keywords: Complex networks; Minimum Dominating Set; Banking supervision; monitoring optimization
Online: 6 May 2022 (09:08:42 CEST)
The global financial crisis of 2008, triggered by the collapse of Lehman Brothers, highlighted a banking system that was widely exposed to systemic risk. The minimization of the systemic risk via a close and detailed monitoring of the entire banking network became a priority. This is a complex and demanding task considering the size of the banking systems: in the US and the EU they include more than 10000 institutions. In this paper, we introduce a methodology which identifies a subset of banks that can: a) efficiently represent the behavior of the whole banking system and b) provide, in the case of a failure, a plausible range of the crisis dispersion. The proposed methodology can be used by the regulators as an auxiliary monitoring tool, to identify groups of banks that are potentially in distress and try to swiftly remedy their problems and minimize the propagation of the crisis by restricting contagion. This methodology is based on Graph Theory and more specifically Complex Networks. We termed this setting a “multivariate Threshold – Minimum Dominating Set” (mT–MDS) and it is an extension of the Threshold – Minimum Dominating Set methodology (Gogas e.a., 2016). The method was tested on a dataset of 570 U.S. banks: 429 solvent and 141 failed ones. The variables used to create the networks are: the total interest expense, the total interest income, the tier 1 (core) risk-based capital and the total assets. The empirical results reveal that the proposed methodology can be successfully employed as an auxiliary tool for the efficient supervision of a large banking network.
ARTICLE | doi:10.20944/preprints202308.0955.v1
Subject: Computer Science And Mathematics, Data Structures, Algorithms And Complexity Keywords: Meta-heuristic; Dominating tree; Dual neighborhoods; Fast neighborhood evaluation; Optimization
Online: 14 August 2023 (09:13:05 CEST)
The minimum dominating tree (MDT) problem consists of finding a minimum weight sub-graph from an undirected graph, such that each vertex not in this sub-graph is adjacent to at least one of the vertices in it, and the sub-graph is connected without any ring structures. This paper presents a Dual Neighborhoods Search (DNS) algorithm for solving the MDT problem, which integrates several distinguishing features, such as two neighborhoods collaboratively working for optimizing the objective function, a fast neighborhood evaluation method to boost the searching effectiveness, and several diversification techniques to help the searching process jump out of the local optimum trap thus obtaining better solutions. DNS improves the previous best-known results for 4 public benchmark instances while providing competitive results for the remaining ones. Several ingredients of DNS are investigated to demonstrate the importance of the proposed ideas and techniques.
ARTICLE | doi:10.20944/preprints202201.0249.v1
Subject: Computer Science And Mathematics, Applied Mathematics Keywords: domination, detection system, identifying-code, open-locating-dominating set, fault-tolerant, king's grid, density
Online: 18 January 2022 (09:43:55 CET)
A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identify an "intruder" at any vertex. We consider two types of detection systems: open-locating-dominating (OLD) sets and identifying codes (ICs). An OLD set gives each vertex a unique, non-empty open neighborhood of detectors, while an IC provides a unique, non-empty closed neighborhood of detectors. We explore their fault-tolerant variants: redundant OLD (RED:OLD) sets and redundant ICs (RED:ICs), which ensure that removing/disabling at most one detector guarantees the properties of OLD sets and ICs, respectively. This paper focuses on constructing optimal RED:OLD sets and RED:ICs on the infinite king's grid, and presents the proof for the bounds on their minimum densities; [3/10, 1/3] for RED:OLD sets and [3/11, 1/3] for RED:ICs.
ARTICLE | doi:10.20944/preprints201805.0012.v1
Subject: Computer Science And Mathematics, Computer Vision And Graphics Keywords: NP-complete; graph theory; layered graph; polynomial time; quasi-polynomial time; dynamic programming; independent set; vertex cover; dominating set
Online: 2 May 2018 (05:41:54 CEST)
The independent set, IS, on a graph is such that no two vertices in have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. is a vertex cover, i.e. VC of if every is incident upon at least one vertex in . is dominating set, DS, of if either or and . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if then MIS, MVC and MDS can be computed in polynomial time and if , where , then MCV and MCD can be computed in polynomial time. If , for , then MIS, MVC and MDS require quasi-polynomial time. If then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.