Search
Filters
total: 123
filtered: 97
Chosen catalog filters
Search results for: elementary graph-set descriptor
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Generalized Dold sequences on partially-ordered sets
PublicationDold sequences constitute an important class of integer sequences that play an important role in combinatorics, number theory, topology and dynamical systems. We generalize the notion of Dold sequence for the case of partially ordered sets and describe their properties. In particular we give two alternative descriptions of generalized Dold sequences: by some class of elementary sequences as well as by different...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublicationIn this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.
-
Certified domination
PublicationImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
The Maslov index and the spectral flow—revisited
PublicationWe give an elementary proof of a celebrated theorem of Cappell, Lee and Miller which relates the Maslov index of a pair of paths of Lagrangian subspaces to the spectral flow of an associated path of self-adjoint first-order operators. We particularly pay attention to the continuity of the latter path of operators, where we consider the gap-metric on the set of all closed operators on a Hilbert space. Finally, we obtain from Cappell,...
-
Pawlak's flow graph extensions for video surveillance systems
PublicationThe idea of the Pawlak's flow graphs is applicable to many problems in various fields related to decision algorithms or data mining. The flow graphs can be used also in the video surveillance systems. Especially in distributed multi-camera systems which are problematic to be handled by human operators because of their limited perception. In such systems automated video analysis needs to be implemented. Important part of this analysis...
-
Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
PublicationIn this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party xor game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Parallel immune system for graph coloring
PublicationThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Algorithms for testing security in graphs
PublicationIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Graph security testing
PublicationSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Bounds on the cover time of parallel rotor walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Reliability of production machines in the bakery industry – theoretical and practical issues
PublicationThe aim of the article is to present probabilistic models, which were then used to analyze the reliability of production machines in the baking industry. The author conducted research in the period from January 2, 2016 to December 31, 2018 regarding the measurement of reliability of a traditional production system based on a probabilistic concept. Due to the limited scope of the article, reliability calculations for a set of thermo-oil...
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
KOALA Graph Theory Internet Service
PublicationKOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discreate optimization. During the C2NIWA project, a library has been greatly ectended, the code refactored and enclosed with the internet service available in the public repository of thr project. Today it contains interconnected educational materials in the form...
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Separability Assessment of Selected Types of Vehicle-Associated Noise
PublicationMusic Information Retrieval (MIR) area as well as development of speech and environmental information recognition techniques brought various tools in-tended for recognizing low-level features of acoustic signals based on a set of calculated parameters. In this study, the MIRtoolbox MATLAB tool, designed for music parameter extraction, is used to obtain a vector of parameters to check whether they are suitable for separation of...
-
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Selection of effective cocrystals former for dissolution rate improvement of active pharmaceutical ingredients based on lipoaffinity index
PublicationNew theoretical screening procedure was proposed for appropriate selection of potential cocrystal formers possessing the ability of enhancing dissolution rates of drugs. The procedure relies on the training set comprising 102 positive and 17 negative cases of cocrystals found in the literature. Despite the fact that the only available data were of qualitative character, performed statistical analysis using binary classification...
-
Global defensive secure structures
PublicationLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Analysis of Impulse Responses Measured in Motion in a Towing Tank
PublicationThe growing interest in developing autonomous underwater vehicles (AUVs) and creating underwater sensor networks (USNs) has led to a need for communication tools in underwater environments. For obvious reasons, wireless means of communication are the most desirable. However, conducting research in real conditions is troublesome and costly. Moreover, as hydroacoustic propagation conditions change very significantly, even during...
-
Analysis of Impulse Responses Measured in Motion in a Towing Tank
PublicationThe growing interest in developing autonomous underwater vehicles (AUVs) and creating underwater sensor networks (USNs) has led to a need for communication tools in underwater environments. For obvious reasons, wireless means of communication are the most desirable. However, conducting research in real conditions is troublesome and costly. Moreover, as hydroacoustic propagation conditions change very significantly, even during...
-
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions
PublicationAbility to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in...
-
A new anisotropic bending model for nonlinear shells: Comparison with existing models and isogeometric finite element implementation
PublicationA new nonlinear hyperelastic bending model for shells formulated directly in surface form is presented, and compared to four existing prominent bending models. Through an essential set of elementary nonlinear bending test cases, the membrane and bending stresses of each model are examined analytically. Only the proposed bending model passes all the test cases, while the other bending models either fail or only pass the test cases for...
-
On coertia and inertia in aspects of Natanson’s nonlinear extended thermodynamics
PublicationIn this article, the previously underrepresented contributions of Natanson to the field of thermodynamics have been presented. In order to identify a source of irreversibility at Nature, Natanson introduced the concept of Coertia, which is similar to inertia. Natanson’s Coertia is a fundamental property of space that is responsible for every irreversible phenomena in matter, as well as in the electromagnetic and gravitational fields....
-
Stereo vision with Equal Baseline Multiple Camera Set (EBMCS) for obtaining depth maps of plants
PublicationThis paper presents a method of improving the estimation of distances between an autonomous harvesting robot and plants with ripe fruits by using the vision system based on five cameras. The system is called Equal Baseline Multiple Camera Set (EBMCS). EBMCS has some features of a camera matrix and a camera array. EBMCS is regarded as a set of stereo cameras for estimating distances by obtaining disparity maps and depth maps. This...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublicationW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
In silico modelling for predicting the cationic hydrophobicity and cytotoxicity of ionic liquids towards the Leukemia rat cell line, Vibrio fischeri and Scenedesmus vacuolatus based on molecular interaction potentials of ions
PublicationIn this study we present prediction models for estimating in silico the cationic hydrophobicity and the cytotoxicity (log [1/EC50]) of ionic liquids (ILs) towards the Leukemia rat cell line (IPC-81), the marine bacterium Vibrio fischeri and the limnic green algae Scenedesmus vacuolatus using linear free energy relationship (LFER) descriptors computed by COSMO calculations. The LFER descriptors used for the prediction model (i.e....
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
PublicationThis paper continues the work by Wang et al. [17]. Its goal is to verify the robustness of the NGCF (Neural Graph Collaborative Filtering) technique by assessing its ability to generalize across different datasets. To achieve this, we first replicated the experiments conducted by Wang et al. [17] to ensure that their replication package is functional. We received sligthly better results for ndcg@20 and somewhat poorer results for...
-
Mass spectrometry based identification of geometric isomers during metabolic stability study of a new cytotoxic sulfonamide derivatives supported by quantitative structure-retention relationships
PublicationA set of 15 new sulphonamide derivatives, presenting antitumor activity have been subjected to a metabolic stability study. The results showed that besides products of biotransformation, some additional peaks occurred in chromatograms. Tandem mass spectrometry revealed the same mass and fragmentation pathway, suggesting that geometric isomerization occurred. Thus, to support this hypothesis, quantitative structure-retention relationships...
-
Experimental and theoretical investigation of conformational states and noncovalent interactions in crystalline sulfonamides with a methoxyphenyl moiety
PublicationFour sulfonamide derivatives with a methoxyphenyl moiety, namely N-{4-[(2-methoxyphenyl)sulfamoyl] phenyl}acetamide (1a), N-{4-[(3-methoxyphenyl)sulfamoyl]phenyl}acetamide (1b), 4-amino-N-(2- methoxyphenyl)benzenesulfonamide (2a) and 4-amino-N-(3-methoxyphenyl)benzenesulfonamide (2b), have been synthesized and characterized physiochemically by CHNS, MS, FT-IR, 1H NMR, 13C NMR, PXRD and TG methods. Crystal structures were determined...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Distributed graph searching with a sense of direction
PublicationIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
SMART SHOP SERVICES FOR BUILDING CUSTOMER-ORIENTED SCENARIOS
PublicationThe shops of today mostly support the customer by offering him or her products based on basic relationships between products viewed or ordered by users with similar tastes. This common approach may fail in many cases especially when the user does not have sufficient knowledge about the market, or when he or she wants to build a set of products in more than one shop. New categories of smart shop services are proposed in order to...
-
Scheduling of compatible jobs on parallel machines
PublicationThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Agent-based social network as a simulation of a market behaviour
PublicationRecent years and the outbreak of world's economic crisis in 2008 proved the crucial importance of reliable analysis of market dynamics. However, werarely apply models of proper detail level (the global prosperity forecast of 2007 can be seen as a grim proof). The behaviour of individuals and companies is far from being ideal and rational. Many claims that the economic paradigm of rational expectations (coming from J. Muth and R....
-
Architektura a dekonstrukcja. Przypadek Petera Eisenmana i Bernarda Tschumiego
PublicationArchitecture and Deconstruction Case of Peter Eisenman and Bernard Tschumi Introduction Towards deconstruction in architecture Intensive relations between philosophical deconstruction and architecture, which were present in the late 1980s and early 1990s, belong to the past and therefore may be described from a greater than...