Search
displaying 1000 best results Help
Search results for: EXTREMAL GRAPH THEORY
-
International Conference on Database Theory
Conferences -
Computing: The Australasian Theory Symposium
Conferences -
Practice and Theory of Automated Timetabling
Conferences -
International Conference on Concurrency Theory
Conferences -
Sem VI_ENG_Theory of landscape design
e-Learning CoursesTheory of landscape design SDGs in landscape design Technical detailing of landscaping solutions
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
International Symposium on Fundamentals of Computation Theory (International Symposium on Fundamentals of Computer Theory)
Conferences -
Jerzy Konorski dr hab. inż.
PeopleJerzy Konorski received his M. Sc. degree in telecommunications from Gdansk University of Technology, Poland, and his Ph. D. degree in computer science from the Polish Academy of Sciences, Warsaw, Poland. In 2007, he defended his D. Sc. thesis at the Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology. He has authored over 150 papers, led scientific projects funded by the European Union,...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Robert Piotrowski dr hab. inż.
PeopleRobert Piotrowski jest absolwentem Wydziału Elektrotechniki i Automatyki (2001r., kierunek: Automatyka i Robotyka) oraz Wydziału Zarządzania i Ekonomii (2002r., kierunek: Organizacja Systemów Produkcyjnych) Politechniki Gdańskiej. Od 2005 roku jest zatrudniony na Wydziale Elektrotechniki i Automatyki, aktualnie w Katedrze Inteligentnych Systemów Sterowania i Wspomagania Decyzji. W 2005 roku obronił rozprawę doktorską (Automatyka...
-
Drawing maps with advice
PublicationW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Non-isolating 2-bondage in graphs
PublicationA 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)....
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublicationThe paper presents an uniform, port-based approach to modelling of beam/bar systems (trusses). Port-based model of such distributed parameter system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The constructed computational package enables the frequency...
-
Compact Quasi-Elliptic-Type Inline Waveguide Bandpass Filters With Nonlinear Frequency-Variant Couplings
PublicationThis work presents the design techniques to synthesize a class of compact inline quasi-elliptic-type waveguide cavity bandpass filters based on novel nonlinear frequency-variant couplings (NFVCs). These highly dispersive frequency-variant couplings (FVCs) are realized by means of a pair of partial-height posts that are placed at the junctions between every two cavity resonators. Each NFVC produces a transmission pole in between...
-
Inverse Nonlinear Eigenvalue Problem Framework for the Synthesis of Coupled-Resonator Filters With Nonresonant Nodes and Arbitrary Frequency-Variant Reactive Couplings
PublicationA novel, general circuit-level description of coupledresonator microwave filters is introduced in this article. Unlike well-established coupling-matrix models based on frequency-invariant couplings or linear frequency-variant couplings (LFVCs), a model with arbitrary reactive frequencyvariant coupling (AFVC) networks is proposed. The engineered formulation is more general than prior-art ones—with the only restriction that the coupling...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Liczby Ramseya on-line dla różnych klas grafów
PublicationRozpatrujemy grę rozgrywaną na nieskończonej liczbie wierzchołków, w której każda runda polega na wskazaniu krawędzi przez jednego gracza - Budowniczego oraz pokolorowaniu jej przez drugiego gracza - Malarkę na jeden z dwóch kolorów, czerwony lub niebieski. Celem Budowniczego jest zmuszenie Malarki do stworzenia monochromatycznej kopii wcześniej ustalonego grafu H w jak najmniejszej możliwej liczbie ruchów. Zakładamy, że gracze...
-
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublicationIn the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
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 hat problem on cycles on at least nine vertices
PublicationThe 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...
-
2-Coloring number revisited
Publication2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
A note on total reinforcement in graphs
PublicationIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Computability in Europe: Logic and Theory of Algorithms
Conferences -
International Symposium on Algorithmic Game Theory
Conferences -
European PKI Workshop: Theory and Practice
Conferences -
Workshop in Information Security Theory and Practices
Conferences -
International Conference on Computer Theory and Applications
Conferences -
Conference on Theory and Applications of Models of Computation
Conferences -
International Workshop on Issues in the Theory of Security
Conferences -
IEEE International Symposium on Information Theory
Conferences -
Thermo-resonance analysis of an excited graphene sheet using a new approach
PublicationForced vibration of graphene nanoplate based on a refined plate theory in conjunction with higher-order nonlocal strain gradient theory in the thermal environment has been investigated. Regarding the higher-order nonlocal strain gradient theory, both stress nonlocality and size-dependent effects are taken into account, so the equilibrium equations which are governing on the graphene sheet have been formulated by the theory....
-
International Conference on the Theory of Information Retrieval (The 3rd ACM International Conference on the Theory of Information Retrieval)
Conferences -
Network economy and innovation policy st 2024/2025
e-Learning CoursesGlobal Studies / Economics Analytics, II stopień (magisterskie), 3 semestr The aim of the course is to provide framework for exploring innovation theory in the context of the network economy.
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
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...
-
MODELLING OF CUTTING BY MEANS OF FRACTURE MECHANICS
PublicationThe suitability of modern fracture mechanic theory was proved for the estimation of the cutting force and the cutting specific resistance. This paper shows modification of Ernst-Merchant theory and its application for determination some other properties of wood sample. This theory is acceptable for evaluation of shear yield stresses and shear plane angle. Sawing by gang saw machine was used as a process similar to the orthogonal...
-
Modelling of cutting by means of fracture mechanics
PublicationThe suitability of modern fracture mechanic theory was proved for the estimation of the cutting force and the cutting specific resistance. This paper shows modification of Ernst-Merchant theory and its application for determination some other properties of wood sample. This theory is acceptable for evaluation of shear yield stresses and shear plane angle. Sawing by gang saw machine was used as a process similar to the orthogonal...
-
TEORIA DECYZYJNYCH PROCESÓW SEMI-MARKOWA I JEJ ZASTOSOWANIE W PROJEKTOWANIU I EKSPLOATACJI OKRĘTOWYCH SILNIKÓW GŁÓWNYCH I INNYCH URZĄDZEŃ SIŁOWNI OKRĘTOWYCH
PublicationW referacie zaprezentowano znaczenie teorii procesów semi-Markowa w naukach technicznych, zwłaszcza w teorii niezawodności urządzeń technicznych, teorii bezpieczeństwa ich działania oraz statystycznej teorii podejmowania decyzji eksploatacyjnych. W referacie wyeksponowano także przydatność teorii procesów semi-Markowa w teorii i praktyce eksploatacji wspomnianych urządzeń technicznych na przykładzie tak istotnych urządzeń w transporcie...