Search
Filters
total: 2910
filtered: 2186
displaying 1000 best results Help
Search results for: SCATTERING NUMBER, MATCHING NUMBER
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Zero-Pole Space Mapping for CAD of Filters
PublicationIn this paper, we propose a new space-mapping technique tailored to the CAD of microwave filters. The goal of space mapping is to achieve a satisfactory design with the minimal number of fine model evaluations. In our approach, the filter is represented by a rational function. To quickly align the coarse and fine models, and to speed up the direct optimization of the coarse model, we propose matching the zeros and poles of a rational...
-
Greedy Multipoint Model-Order Reduction Technique for Fast Computation of Scattering Parameters of Electromagnetic Systems
PublicationThis paper attempts to develop a new automated multipoint model-order reduction (MOR) technique, based on matching moments of the system input–output function, which would be suited for fast and accurate computation of scattering parameters for electromagnetic (EM) systems over a wide frequency band. To this end, two questions are addressed. Firstly, the cost of the wideband reduced model generation is optimized by automating a...
-
Scattering and Propagation Analysis for the Multilayered Structures Based on Field Matching Technique
PublicationA semi-analytical method is employed to the analysis of scattering and guiding problems in multilayer dielectric structures. The approach allows to investigate objects with arbitrary convex cross section and is based on the direct field matching technique involving the usage of the field projection at the boundary on a fixed set of orthogonal basis functions. For the scattering problems the scattered field in the far zone is calculated...
-
An Analysis of Scattering from Ferrite Post of Arbitrary Convex Cross Section with the Use of Field Matching Method
PublicationA problem of electromagnetic wave scattering from ferrite post is presented. The post is assumed to be located in closed areas as waveguide junction, or in open area illuminated by a plane wave. The object is of arbitrary convex cross section and the method of analysis is semi-analytical, based on the direct field matching technique.
-
Scattering From a Cylindrical Object of Arbitrary Cross Section With the Use of Field Matching Method
PublicationA simple and intuitive solution to scattering problems in shielded and open structures is presented. The main idea of the analysis is based on the direct field matching technique involving the usage of projection of the fields at the boundary on a fixed set of orthogonal basis functions. Different convex shapes and various obstacle materials are considered to verify the validity of the method in open and closed structures. The...
-
An Analysis of Cylindrical Posts of Arbitrary Convex Cross Sections Located in Waveguide Junctions with the Use of Field Matching Method
PublicationA problem of electromagnetic wave scattering from cylindrical posts of arbitrary cross section located in waveguide junction is presented. The method of analysis is based on the direct field matching technique. Multimode scattering matrices of every section of waveguide junction are calculated and cascading procedure is utilized to investigate the whole structure. The results are verified by comparing them with those obtained from...
-
Finite element/mode-matching analysis of ferrite/dielectric line junctions of arbitrary cross-section
PublicationThis paper is focused on the analysis of line junctions obtained as a cascade of dielectric and ferrite guides of arbitrary cross-section. The main application of such structures is nonreciprocal devices such as isolators, circulators, or phase shifters. The efficient finite element/mode-matching approach is proposed to the analysis of such structures. In this approach, thefiniteelementmethod is applied todetermine propagation...
-
Hybrid Analysis of Structures Composed of Axially Symmetric Objects
Publication— A hybrid method for the scattering problems in shielded and open structures is presented. The procedure is based on the combination of body-of-revolution involving finite-element methods with impedance matrix formulation and the mode-matching technique, which can be utilized for the analysis of structures with axially symmetrical scatterers. In order to confirm the validity and efficiency of the proposed approach, a few examples...
-
An Analysis of Periodic Arrangements of Cylindrical Objects of Arbitrary Convex Cross Sections with the Use of Field Matching Method
PublicationA problem of electromagnetic wave scattering from multilayered frequency selective surfaces is presented. Each surface is composed of periodically arranged cylindrical posts of arbitrary convex cross-section. The method of analysis is based on the direct field matching technique for a single cell, and the transmission matrix method with the lattice sums technique for periodic arrangement of scatterers.
-
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)....
-
Communication Model Order Reduction in Hybrid Methods Involving Generalized Impedance Matrix
PublicationA novel strategy for the efficient analysis of frequency-domain scattering electromagnetic problems in open and closed domains is presented. A fully automatic model-order reduction technique, called the enhanced reduced-basis method, is applied to increase the efficiency of the hybrid approach, which combines the finite-element and mode-matching methods. Numerical tests show that the proposed algorithm yields reliable and highly...
-
Application of hybrid finite-difference mode-matching method to analysis of structures loaded with axially-symmetrical posts
PublicationW artykule przedstawiono nową metodę hybrydową do analizy układów falowodowych zawierających dowolne konfiguracje obiektów osiowo-symetrycznych. Metoda oparta jest na połączeniu metody różnic skończonych, metody dopasowania rodzajów oraz iteracyjnej procedury rozpraszania. W pracy przedstawiono badania zbieżności metody. Uzyskane wyniki numeryczne porównano z wynikami odniesienia. Duża zgodność wyników potwierdziła poprawność opracowanego...
-
Hybrid Technique for the EM Scattering Analysis with the Use of Ring Domain Decomposition
PublicationA hybrid technique combining finite-element and mode-matching methods for the analysis of scattering problems in open space is presented here. The main idea is based on impedance matrix descriptions of the boundary surrounding the discrete computational domain and combine it with external field described analytically. The discrete analysis, which is the most time- and memory-consuming, is limited here only to the close proximity...
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Bondage number of grid graphs
PublicationThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
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...
-
Navier number and transition to turbulence
PublicationThe motivation behind this article is to explain a role of the Navier number (Na -dimensionless slip-length) in prediction of closures for laminar to turbulent transition undergoing via eddies detachment from the slip layer in nano-cannals. Additionally the role of the Navier number Na in universal modeling of phenomenon of enhanced mass flow rate reported in micro- and nano-channels has been explained. The Na number should be...
-
Limitations of WSSUS modeling of stationary underwater acoustic communication channel
PublicationPerformances of underwater acoustic communication (UAC) systems are strongly related to specific propagation conditions of the underwater channel. Due to their large variability, there is a need for adaptive matching of the UAC systems signaling to the transmission properties of the channel. This requires a knowledge of instantaneous channel characteristics, in terms of the specific parameters of stochastic models. The wide-sense...
-
Electromagnetic plane wave scattering from a cylindrical object with an arbitrary cross section using a hybrid technique
PublicationA hybrid technique combining finite-element and mode-matching methods for the analysis of scattering problems in open and closed areas is presented. The main idea of the analysis is based on the utilization of the finite-element method to calculate the post impedance matrix and combine it with external excitation. The discrete analysis, which is the most time- and memory-consuming, is limited here only to the close proximity of...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
On domination multisubdivision number of unicyclic graphs
PublicationThe 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...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublicationThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
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...
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
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...
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
On trees attaining an upper bound on the total domination number
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Multi-layered tissue head phantoms for noninvasive optical diagnostics
PublicationExtensive research in the area of optical sensing for medical diagnostics requires development of tissue phantoms with optical properties similar to those of living human tissues. Development and improvement of in vivo optical measurement systems requires the use of stable tissue phantoms with known characteristics, which are mainly used for calibration of such systems and testing their performance over time. Optical and mechanical...
-
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) =...
-
On the independence number of some strong products of cycle-powers
PublicationIn the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish...
-
Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations
PublicationThe paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...
-
Entanglement and Nonlocality are Inequivalent for Any Number of Parties
PublicationUnderstanding the relation between nonlocality and entanglement is one of the fundamental problems in quantum physics. In the bipartite case, it is known that these two phenomena are inequivalent, as there exist entangled states of two parties that do not violate any Bell inequality. However, except for a single example of an entangled three-qubit state that has a local model, almost nothing is known about such a relation in multipartite...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
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...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a 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. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
Impact of Cyclist Facility Availability at Work on the Number of Bike Commuters
PublicationThe article describes the results of research designed to establish whether cycle provision can influence the number of employees commuting by bike. To that end, employee surveys were conducted in three IT companies in 2012 and 2016. The questionnaire asked about travel behaviour and what the staff thought about their company’s provision of cyclist facilities. Since 2012 each of the companies has moved its head office and the...
-
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...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph 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 nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Zero-pole approach to computer aided design of in-line siw filters with transmission zeros
PublicationThis paper presents a design of a new type of in-line pseudo-elliptic filters implemented in substrate integrated waveguide(SIW) technology. To realize transmission zeros in in-line topology,frequency-dependent couplings were used. Such dispersive couplingswere implemented as shorted stubs. The design process startswith the generation of a suitable starting point. To this end, anapproximation of SIW as a rectangular waveguide is...
-
Mechanical exfoliation and layer number identification of single crystal monoclinic CrCl3
PublicationAfter the recent finding that CrI3, displays ferromagnetic order down to its monolayer, extensive studies have followed to pursue new two-dimensional (2D) magnetic materials. In this article, we report on the growth of single crystal CrCl3 in the layered monoclinic phase. The system after mechanical exfoliation exhibits stability in ambient air (the degradation occurs on a time scale at least four orders of magnitude longer than...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 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 a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
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...