Search results for: equitable chromatic number - Bridge of Knowledge

Search

Search results for: equitable chromatic number

Filters

total: 2951
filtered: 2218

clear all filters


Chosen catalog filters

  • Category

  • Year

  • Options

clear Chosen catalog filters disabled

Search results for: equitable chromatic number

  • Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

    Publication

    - Opuscula Mathematica - Year 2016

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

    Full text available to download

  • Flow structure, heat transfer and scaling analysis in the case of thermo-magnetic convection in a differentially heated cylindrical enclosure

    Publication
    • E. Fornalik-Wajs
    • P. Filar
    • J. Wajs
    • A. Roszko
    • L. Pleskacz
    • H. Ozoe

    - Journal of Physics : Conference Series - Year 2014

    The experimental, numerical and scaling analysis in the case of thermo-magnetic convection in a thermosyphon-like enclosure filled with a paramagnetic fluid is presented. Visualization of temperature field together with the numerical simulation gave an information about the flow structure, which indicated “finger-like” structures of hot and cold streams advecting each other. Their number depended on the Rayleigh number and also...

    Full text available to download

  • On the connected and weakly convex domination numbers

    In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...

    Full text available to download

  • The reliability of tree and star networks

    This paper investigated the reliability of tree and star networks. Following measures of network reliability are assumed: the expected number of nodes, that can communicate with the central node; the expected number of node pairs, that are connected by a path through the central node; the expected number of node pairs communicating.

    Full text to download in external service

  • Fluid structure interaction study of non-Newtonian Casson fluid in a bifurcated channel having stenosis with elastic walls

    Publication

    - Scientific Reports - Year 2022

    Fluid–structure interaction (FSI) gained a huge attention of scientists and researchers due to its applications in biomedical and mechanical engineering. One of the most important applications of FSI is to study the elastic wall behavior of stenotic arteries. Blood is the suspension of various cells characterized by shear thinning, yield stress, and viscoelastic qualities that can be assessed by using non-Newtonian models. In this...

    Full text available to download

  • Effect of Temperature and Nanoparticle Concentration on Free Convective Heat Transfer of Nanofluids

    Publication

    - ENERGIES - Year 2021

    A theoretical analysis of the influence of temperature and nanoparticle concentration on free convection heat transfer from a horizontal tube immersed in an unbounded nanofluid was presented. The Nusselt (Nu) number and heat transfer coefficient were parameters of the intensity of the convective heat transfer. For free convection, the Nu number was a function of the Rayleigh (Ra) number and Prandtl (Pr) number. The Rayleigh (Ra)...

    Full text available to download

  • Numerical simulation of natural convection of Glycol-Al2O3 nanofluids from a horizontal cylinder

    Publication

    - HEAT TRANSFER ENGINEERING - Year 2021

    This paper deals with natural convection around a circular cylinder with constant heat flux in a cavity using computational fluid dynamics. As fluids ethylene glycol and a mixture of ethylene glycol with Al2O3 nanoparticles (mass concentrations of nanoparticles: 0.1% and 1%) are chosen. Rayleigh number ranges from 3104 to 3105. The nanofluids are modeled with single-phase approach. For the investigated range of nanoparticle concentration, the...

    Full text available to download

  • Scanning networks with cactus topology

    Publication
    • Ł. Wrona

    - Year 2008

    The family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...

  • Experimental Investigation of Free Convection Heat Transfer from Horizontal Cylinder to Nanofluids

    Publication

    - ENERGIES - Year 2021

    The results of free convection heat transfer investigation from a horizontal, uniformly heated tube immersed in a nanofluid are presented. Experiments were performed with five base fluids, i.e., ethylene glycol (EG), distilled water (W) and the mixtures of EG and water with the ratios of 60/40, 50/50, 40/60 by volume, so the Rayleigh (Ra) number range was 3 104 Ra 1.3 106 and the Prandtl (Pr) number varied from 4.4 to 176....

    Full text available to download

  • 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 construction for the hat problem on a directed graph

    Publication

    A team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...

    Full text available to download

  • The paired-domination and the upper paired-domination numbers of graphs

    Publication

    In this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.

    Full text available to download

  • Towards a classification of networks with asymmetric inputs

    Publication

    - NONLINEARITY - Year 2021

    Coupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...

    Full text available to download

  • Super Dominating Sets in Graphs

    Publication

    In this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.

    Full text to download in external service

  • The methodology of design of satellite working mechanism of positive displacement machine

    Publication

    In this paper is described a methodology of design of satellite mechanism consisting of two noncircular gears (externally toothed rotor and internally toothed curvature) and circular gears (satellites). In the presented methodology is assumed that the rotor pitch line is known, and the curvature pitch line is necessary to designate. The presented methodology applies to mechanisms for which the number of the curvature humps is at...

    Full text available to download

  • Theoretical analysis of a new approach to order determination for a modified Prony method in swath mapping application

    Publication

    - HYDROACOUSTICS - Year 2017

    This article presents a new approach to determine the model order (number of principal components) in the modified Prony method applied to swath acoustic mapping. Determination of the number of principal components is a crucial step in the modified Prony method. In the proposed approach the model order is chosen based on the underlying physical model of the underwater acoustic environment, and utilised signal processing operations....

    Full text available to download

  • Development of a tropical disease diagnosis system using artificial neural network and GIS

    Publication

    - Year 2021

    Expert systems for diagnosis of tropical diseases have been developed and implemented for over a decade with varying degrees of success. While the recent introduction of artificial neural networks has helped to improve the diagnosis accuracy of such systems, this aspect is still negatively affected by the number of supported diseases. A large number of supported diseases usually corresponds to a high number of overlapping symptoms,...

    Full text to download in external service

  • CIVILIZING THE PUBLIC PARTICIPATION PRACTICE IN POST-TRANSITION COUNTRIES

    The phenomenon of public participation is not so new to both planning theory and practice. In fact, involving local community in the decision-making process regarding local urban development directions is widely discussed and a number of various forms of these are being introduced. This paper deals with a number of

    Full text available to download

  • DATA JOURNALS AND DATA PAPERS IN VARIOUS RESEARCH AREAS AND SCIENTIFIC DISCIPLINES – BIBLIOMETRIC ANALYSIS BASED ON INCITES

    Publication

    - TASK Quarterly - Year 2021

    The main aim of this work is to provide insight into a bibliometric analysis of Data Journals and Data Papers in terms of research areas, disciplines, publication year and country. In particular, we calculated many bibliometric indicators, especially: the number of publications and citations. Furthermore, this work also investigated the top 20 journals in which scientists published the largest number of Data Papers. It was found...

    Full text available to download

  • Types of Markov Fields and Tilings

    Publication

    - IEEE TRANSACTIONS ON INFORMATION THEORY - Year 2016

    The method of types is one of the most popular techniques in information theory and combinatorics. However, thus far the method has been mostly applied to one-dimensional Markov processes, and it has not been thoroughly studied for general Markov fields. Markov fields over a finite alphabet of size m ≥ 2 can be viewed as models for multi-dimensional systems with local interactions. The locality of these interactions is represented...

    Full text available to download

  • Emission of 1.3–10 nm airborne particles from brake materials

    Publication

    - AEROSOL SCIENCE AND TECHNOLOGY - Year 2017

    Operation of transport vehicle brakes makes a significant contribution to airborne particulate matter in urban areas, which is subject of numerous studies due to the environmental concerns. We investigated the presence and number fractions of 1.3–10 nm airborne particles emitted from a low-metallic car brake material (LM), a non-asbestos organic car brake material (NAO) and a train brake cast iron against a cast iron. Particles...

    Full text available to download

  • Impact of Temperature and Nanoparticle Concentration on Turbulent Forced Convective Heat Transfer of Nanofluids

    Publication

    - ENERGIES - Year 2022

    Theoretical analysis of the influence of nanoparticles and temperature on the average Nusselt (Nu) number and the average heat transfer coefficient (HTC) during the turbulent flow of nanofluid in a horizontal, round tube was carried out. The Nu number is a function of the Reynolds (Re) number and the Prandtl (Pr) number, which in turn are functions of the thermophysical properties of the liquid and the flow conditions. On the other...

    Full text available to download

  • Preliminary Identification of Quantitative Factors Determining the Duration of Court Proceedings in Commercial Cases

    Publication

    - European Research Studies Journal - Year 2020

    Purpose: The aim of the article was to identify factors that are linear combinations of the variables under scrutiny that affect the duration of court proceedings. Design/Methodology/Approach: This research was conducted on commercial cases, based on the Principal Components Analysis (PCA). The original variables were grouped into factors that are correlated with each other. The Kaiser Criterion (own value >1) was chosen as the...

    Full text available to download

  • Study of Non-Newtonian biomagnetic blood flow in a stenosed bifurcated artery having elastic walls

    Publication

    - Scientific Reports - Year 2021

    Fluid structure interaction (FSI) gained attention of researchers and scientist due to its applications in science felds like biomedical engineering, mechanical engineering etc. One of the major application in FSI is to study elastic wall behavior of stenotic arteries. In this paper we discussed an incompressible Non-Newtonian blood fow analysis in an elastic bifurcated artery. A magnetic feld is applied along x direction. For...

    Full text available to download

  • Independent Domination Subdivision in Graphs

    Publication

    - GRAPHS AND COMBINATORICS - Year 2021

    A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...

    Full text available to download

  • On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral

    Publication

    - ARS COMBINATORIA - Year 2015

    The Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....

    Full text available to download

  • Total Domination Versus Domination in Cubic Graphs

    Publication

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

    Full text available to download

  • Preserving Trees in Automata

    Publication

    - Year 2015

    We present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.

    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

  • Free Convection Heat Transfer from Horizontal Cylinders

    Publication

    - ENERGIES - Year 2021

    The results of experimental investigation of free convection heat transfer in a rectangular container are presented. The ability of the commonly accepted correlation equations to reproduce present experimental data was tested as well. It was assumed that the examined geometry fulfils the requirement of no-interaction between heated cylinder and bounded surfaces. In order to check this assumption recently published correlation equations...

    Full text available to download

  • Common Independence in Graphs

    Publication

    - Symmetry-Basel - Year 2021

    Abstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...

    Full text available to download

  • 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 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...

    Full text to download in external service

  • 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

  • THREE-DIMENSIONAL numerical investigation of MHD nanofluid convective heat transfer inside a CUBIC porous container with corrugated bottom wall

    Publication

    - Year 2022

    Simultaneous use of porous media and nanofluid as a heat transfer improvement method has recently captivated a great deal of attention. The heat transfer and entropy production of the Cu-water nanofluid inside a cubic container with a heated bottom wavy wall and an elliptic inner cylinder were numerically analyzed in this study. The container is partitioned into two sections: the left side is filled with permeable media and...

    Full text to download in external service

  • Certified domination

    Publication

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

    Full text available to download

  • Implementation of discrete convolution using polynomial residue representation

    Publication

    - Year 2010

    Convolution is one of the main algorithms performed in the digital signal processing. The algorithm is similar to polynomial multiplication and very intensive computationally. This paper presents a new convolution algorithm based on the Polynomial Residue Number System (PRNS). The use of the PRNS allows to decompose the computation problem and thereby reduce the number of multiplications. The algorithm has been implemented in Xilinx...

  • STARZEJĄCY SIĘ PRZEDSIĘBIORCA W POLSCE I NA ŚWIECIE

    Poniższy artykuł wskazuje na rosnącą liczbę przedsiębiorców w wieku okołoemerytalnym, tak w krajach europejskich, w tym w Polsce, jak i w USA. Wzrost ten wynika zarówno z rosnącej liczby osób w tej grupie wiekowej, które zakładają swoje firmy, jak i z rosnącej liczby osób, które prowadząc od wielu lat swoje firmy, nie zamierzają przejść na emeryturę. Z nielicznych badań wśród osób starszych prowadzących własne firmy wynika, że...

    Full text available to download

  • Thermal visualization of Ostwald-de Waele liquid in wavy trapezoidal cavity: Effect of undulation and amplitude

    Publication
    • A. Hijaz
    • R. Mahmood
    • M. B. Hafeez
    • A. H. Majeed
    • S. Askar
    • H. Shahzad

    - Case Studies in Thermal Engineering - Year 2022

    The present study is concerned with the numerical simulations of Ostwald-de Waele fluid flow in a wavy trapezoidal cavity in the presence of a heated cylinder situated at the center of the cavity. The work consists in characterizing the mixed convection as a function of the intensity of heat flow. The flow behaviour and temperature distribution in a cavity are the main focus of this study. The lower wall of the cavity is fixed...

    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

  • VIBRATION PARAMETERS FOR DAMAGE DETECTION IN STRUCTURES

    The aim of this paper is to examine how damage indicators are sensitive to changing number of frequencies and mode shapes and also to number and location of measurement points. The influence of measurement errors was also analyzed for all cases. For the analysis, those damage indicators are chosen which use changes in such modal parameters as natural frequencies and mode shapes and also differences between the curvatures of the damaged...

    Full text to download in external service

  • Promocja zasobów Pomorskiej Biblioteki Cyfrowej na przykładzie XVIII-wiecznego rękopisu

    Celem artykułu jest przedstawienie sposobu udostępniania i promocji zbiorów rękopiśmiennych na przykładzie XVIII-wiecznego rękopisu Christiana Gabriela Fishera dostępnego w Pomorskiej Bibliotece Cyfrowej (dalej: PBC). Rękopis ten stał się inspiracją do podjęcia współpracy Biblioteki Politechniki Gdańskiej oraz Instytutu Kultury Miejskiej w Gdańsku. Dzięki wspólnej inicjatywie rozpoczęto prace nad transkrypcją niemieckiego tekstu...

    Full text available to download

  • Conditions for Multiple Acquisition of Echoes from Stationary Targets in Successive Transmissions of Active Sonars

    In echolocation, the highest possible number of contacts with a detected target is clearly decisive on the possibilities of echo processing to optimise the estimation of distinctive characteristics of the observed target. In hydrolocation, the slow propagation of acoustic waves in water reduces the number of contacts of echosounders and sonars with detected targets. The article considers model conditions for acquiring multiple...

    Full text available to download

  • Damage detection in plates based on Lamb wavefront shape reconstruction

    Publication

    - MEASUREMENT - Year 2021

    Many of the current studies in the area of damage detection using elastic wave propagation are based on deploying sensor networks with a large number of piezoelectric transducers to detect small-size cracks. A major limitation of these studies is that cracks are usually larger and have different shapes in real cases. Moreover, using a large number of sensing nodes for damage detection is both costly and computationally intensive....

    Full text available to download

  • Three-dimensional numerical investigation of hybrid nanofluids in chain microchannel under electrohydrodynamic actuator

    Energy efficiency enhancement methods have received considerable attentionwithin the industry and scientific community, owing to the rising concern ofglobal energy sustainability. The present article attempts to scrutinize the effectsof electrohydrodynamics and nanofluids on the rate of heat transfer and fluidflow in the 3-D chain microchannels. Improved heat exchangers (e.g., chainmicrochannel) would have a key role in increasing...

    Full text available to download

  • Approximation algorithms for job scheduling with block-type conflict graphs

    Publication

    - COMPUTERS & OPERATIONS RESEARCH - Year 2024

    The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...

    Full text to download in external service

  • On Tradeoffs Between Width- and Fill-like Graph Parameters

    In this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...

    Full text available to download

  • Rozwój polskiego winiarstwa w latach 2000–2017

    W artykule przedstawiono historie polskiego winiarstwa. Na podstawie danych zawartych w raportach Agencji Rynku Rolnego przedstawiono kształtowanie się liczby winnic oraz powierzchni upraw winorośli i zbioru winogron w latach 2009–2018. Dane z portalu winogrodnicy.pl posłużyły do scharakteryzowania liczby winnic wraz z ich lokalizacją oraz powierzchnią. Z przeprowadzonej analizy wynika, że polskie winiarstwo od ponad 20 lat przeżywa...

    Full text available to download

  • An automatic system for identification of random telegraph signal (RTS) noise in noise signals

    In the paper the automatic and universal system for identification of Random Telegraph Signal (RTS) noise as a non-Gaussian component of the inherent noise signal of semiconductor devices is presented. The system for data acquisition and processing is described. Histograms of the instantaneous values of the noise signals are calculated as the basis for analysis of the noise signal to determine the number of local maxima of histograms...

    Full text available to download

  • Independence in uniform linear triangle-free hypergraphs

    Publication

    - DISCRETE MATHEMATICS - Year 2016

    The independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.

    Full text available to download

  • Market Structure and Market Power in Selected Sectors of The Polish Economy Based on COICOP Classification

    Publication

    - Year 2020

    This paper present new and simple measures of market structure and market power. Based on the classical models of market structures, where a given structure is determined by the number of enterprises, indexes of degree of monopoly have been estimated, representing an average number of entities per branch. Additionally, market power indexes have been determined as an average revenue per an enterprise in a given branch. This approach...

    Full text to download in external service