Search results for: CORONA GRAPH - Bridge of Knowledge

Search

Search results for: CORONA GRAPH

Search results for: CORONA GRAPH

  • Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing

    Publication

    Protection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...

  • Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

    Publication

    - NEW JOURNAL OF PHYSICS - Year 2016

    We study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...

    Full text available to download

  • Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms

    Publication

    - ARTIFICIAL INTELLIGENCE - Year 2022

    In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...

    Full text to download in external service

  • Emotion Recognition from Physiological Channels Using Graph Neural Network

    In recent years, a number of new research papers have emerged on the application of neural networks in affective computing. One of the newest trends observed is the utilization of graph neural networks (GNNs) to recognize emotions. The study presented in the paper follows this trend. Within the work, GraphSleepNet (a GNN for classifying the stages of sleep) was adjusted for emotion recognition and validated for this purpose. The...

    Full text available to download

  • A space-efficient algorithm for computing the minimum cycle mean in a directed graph

    An algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.

    Full text to download in external service

  • Weakly convex and convex domination numbers of some products of graphs

    If $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...

  • Consecutive colorings of the edges of general graphs

    Full text to download in external service

  • On Symmetry of Uniform and Preferential Attachment Graphs

    Publication

    - ELECTRONIC JOURNAL OF COMBINATORICS - Year 2014

    Motivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...

    Full text available to download

  • Interval incidence coloring of bipartite graphs

    In this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...

    Full text available to download

  • Colorings of the Strong Product of Circulant Graphs

    Publication
    • M. Jurkiewicz

    - Year 2012

    Graph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.

  • Distance paired domination numbers of graphs

    Publication

    W pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.

    Full text to download in external service

  • Paired domination and doubly domination in graphs

    Publication

    - Year 2007

    W rozprawie poruszane są zagadnienia związane z dominowaniem parami w grafach oraz domiowaniem totalno - powściągniętym w grafach. Ponadto omawiane są zagadnienia związane ze złożonością obliczeniową różnych problemów dominowania w grafach.

  • Weakly connected domination critical graphs

    Praca dotyczy niektórych klas grafów krytycznych ze względu na liczbę dominowania słabo spójnego.

    Full text available to download

  • Compact cyclic edge-colorings of graphs

    Publication

    Artykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...

    Full text to download in external service

  • 2-outer-independent domination in graphs

    Publication

    We initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...

    Full text available to download

  • On Computational Aspects of Greedy Partitioning of Graphs

    Publication

    - Year 2017

    In this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...

    Full text to download in external service

  • Some Progress on Total Bondage in Graphs

    Publication

    - GRAPHS AND COMBINATORICS - Year 2014

    The total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.

    Full text available to download

  • A Framework for Searching in Graphs in the Presence of Errors

    Publication

    - Year 2019

    We consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...

    Full text to download in external service

  • The hat problem on a union of disjoint graphs

    Publication

    The topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...

    Full text available to download

  • Non-isolating 2-bondage in graphs

    A 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....

    Full text available to download

  • Computational aspects of greedy partitioning of graphs

    In this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...

    Full text available to download

  • On the hardness of computing span of subcubic graphs

    In the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.

    Full text to download in external service

  • The Backbone Coloring Problem for Small Graphs

    In this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...

    Full text to download in external service

  • Distributed Evacuation in Graphs with Multiple Exits

    Publication

    We consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...

    Full text to download in external service

  • The complexity of equitable vertex coloring graphs

    Publication

    - Year 2005

    W artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.

  • On proper (1,2)‐dominating sets in graphs

    Publication

    In 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...

    Full text to download in external service

  • Weakly connected Roman domination in graphs

    Publication

    A Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...

    Full text available to download

  • Interval incidence coloring of subcubic graphs

    In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.

    Full text available to download

  • On domination multisubdivision number of unicyclic graphs

    Publication

    The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...

    Full text available to download

  • Dynamic F-free Coloring of Graphs

    Publication

    - GRAPHS AND COMBINATORICS - Year 2018

    A problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...

    Full text available to download

  • A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

    We address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...

    Full text available to download

  • Colon and Rectum

    Journals

    ISSN: 1951-6371

  • JOURNAL OF GRAPH THEORY

    Journals

    ISSN: 0364-9024 , eISSN: 1097-0118

  • Evolution of electrohydrodynamic flow of sduspended particles in a needle-to-plate negative DC corona discharge in air

    Corona discharges are used for collecting dust in electrostatic precipitators (ESPs). The dust collection is mainlyrealized by the electric forces which move the ionized dust particles to the collecting electrodes. However, the presence of coronadischarge in the space between the charging and collecting electrodes in ESPs causes also the so-called ionic wind which set the gasmolecules and dust...

    Full text to download in external service

  • Ochrona i kształtowanie krajobrazów małych ojczyzn - ochrona specyfiki przestrzeni regionalnej

    Publication

    - Year 2005

    Omówienie zagadnienia specyfiki i różnorodności krajobrazu obszarów wiejskich w zależności od historii regionu i stosowanych na przestrzeni wieków lokalnych form architektury, budownictwa i zagospodarowania przestrzennego.

  • CORONARY ARTERY DISEASE

    Journals

    ISSN: 0954-6928 , eISSN: 1473-5830

  • Archaeologia Historica Polona

    Journals

    ISSN: 1425-3534

  • Revista MVZ Cordoba

    Journals

    ISSN: 0122-0268

  • Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions

    Full text to download in external service

  • Sum Coloring of Bipartite Graphs with Bounded Degree

    Publication

    - ALGORITHMICA - Year 2004

    Full text to download in external service

  • Towards Increasing Density of Relations in Category Graphs

    Publication

    In the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...

    Full text to download in external service

  • Bipartite theory of graphs: outer-independent domination

    Publication

    - NATIONAL ACADEMY SCIENCE LETTERS-INDIA - Year 2015

    Let $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...

    Full text to download in external service

  • Minimum order of graphs with given coloring parameters

    Publication

    - DISCRETE MATHEMATICS - Year 2015

    A complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...

    Full text available to download

  • On extremal sizes of locally k-tree graphs

    Publication

    - CZECHOSLOVAK MATHEMATICAL JOURNAL - Year 2010

    A graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...

    Full text to download in external service

  • Strong weakly connected domination subdivisible graphs

    Artykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.

    Full text available to download

  • On the size of identifying codes in triangle-free graphs

    Publication

    - DISCRETE APPLIED MATHEMATICS - Year 2012

    In 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...

    Full text available to download

  • program verification strategy and edge ranking of graphs

    W artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...

    Full text to download in external service

  • Domination-Related Parameters in Rooted Product Graphs

    Abstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.

    Full text to download in external service

  • SELECTED ASPECTS OF THE EVALUATION OF THE QUALITY OF GRAPE WINE

    Publication

    Development of the domestic grape wine market has been presented. The number of grape wine producing entities, acreage, and volume of production over last five years are presented. The composition of red grape wine has been discussed involving health promoting aspects. Two methods of wine quality determination: analytical and sensory meth ods have been described. Physicochemical parameters influencing wine quali ty (acidity, sweetness)...

  • Synchronous black hole search in directed graphs

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2011

    The paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...

    Full text available to download