Search results for: chromatic polynomial

Authors: Zainab Yasir Al-Rekaby, Abdul Jalil M. Khalaf

Abstract:

Coloring the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W14 is chromatically unique.

Keywords: chromatic polynomial, chromatically Equivalent, chromatically unique, wheel

Procedia PDF Downloads 414

Authors: Zainab Yasir Abed Al-Rekaby, Abdul Jalil M. Khalaf

Abstract:

Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W12 is chromatically unique.

Keywords: chromatic polynomial, chromatically equivalent, chromatically unique, wheel

Procedia PDF Downloads 431

Authors: Racha Ghariri, Khaldia Belkheir, Assil Ghariri

Abstract:

In this paper, the researchers present a part of their research on the colors of the city of Bechar (Algeria). It is about a chromatic study of the ancient architecture of the Ksour. Being a subject of intervention, regarding their degradable state, the Ksour are the case of their study, especially that the subject of color does not occupy, virtually, the involved on these heritage sites. This research aims to put the basics for methods which allow to know what to preserve as a color and how to do so, especially during a restoration, and to understand the evolution of the chromatic state of the city.

Keywords: architecture/colours, chromatic identity, geography of colour, regional palette, chromatic architectural analysis

Procedia PDF Downloads 305

Authors: Vandana N. Purav

Abstract:

Fibonacci and Lucas polynomials are special cases of Chebyshev polynomial. There are two types of Chebyshev polynomials, a Chebyshev polynomial of first kind and a Chebyshev polynomial of second kind. Chebyshev polynomial of second kind can be derived from the Chebyshev polynomial of first kind. Chebyshev polynomial is a polynomial of degree n and satisfies a second order homogenous differential equation. We consider the difference equations which are related with Chebyshev, Fibonacci and Lucas polynomias. Thus Chebyshev polynomial of second kind play an important role in finding the recurrence relations with Fibonacci and Lucas polynomials.

Keywords:

Procedia PDF Downloads 368

Authors: Dimitris Varsamis, Nicholas Karampetakis

Abstract:

It is well known that any interpolating polynomial P(x,y) on the vector space Pn,m of two-variable polynomials with degree less than n in terms of x and less than m in terms of y has various representations that depends on the basis of Pn,m that we select i.e. monomial, Newton and Lagrange basis etc. The aim of this paper is twofold: a) to present transformations between the coordinates of the polynomial P(x,y) in the aforementioned basis and b) to present transformations between these bases.

Keywords: bivariate interpolation polynomial, polynomial basis, transformations, interpolating polynomial

Procedia PDF Downloads 405

Authors: Ladznar S. Laja, Rosalio G. Artes, Jr.

Abstract:

This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established.

Keywords: convex subgraph, convex index, generating function, polynomial ring

Procedia PDF Downloads 215

Authors: Puttaswamy, Anwar Alwardi, Nayaka S. R.

Abstract:

One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs.

Keywords: domination polynomial, paired dominating set, paired domination number, paired domination polynomial

Procedia PDF Downloads 232

Authors: S. R. Nayaka, Putta Swamy

Abstract:

Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained.

Keywords: degree polynomial, regular graph, minimum and maximum degree, graph operations

Procedia PDF Downloads 249

Authors: S. Olyaee, M. Seifouri, A. Nikoosohbat, M. Shams Esfand Abadi

Abstract:

Photonic Crystal Fibers (PCFs) can be used in optical communications as transmission lines. For this reason, the PCFs with low confinement loss, low chromatic dispersion, and low nonlinear effects are highly suitable transmission media. In this paper, we introduce a new design of index-guiding photonic crystal fiber (IG-PCF) with ultra-low chromatic dispersion, low nonlinearity effects, and low confinement loss. Relatively low dispersion is achieved in the wavelength range of 1200 to 1600 nm using the proposed design. According to the new structure of IG-PCF presented in this study, the chromatic dispersion slope is -30(ps/km.nm) and the confinement loss reaches below 10-7 dB/km. While in the wavelength range mentioned above at the same time an effective area of more than 50.2μm2 is obtained.

Keywords: optical communication systems, index-guiding, dispersion, confinement loss, photonic crystal fiber

Procedia PDF Downloads 609

Authors: Wongsakorn Charoenpanitseri

Abstract:

The total chromatic number χ"(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no incident or adjacent pair of elements receive the same color Let G be a graph with maximum degree Δ(G). Considering a total coloring of G and focusing on a vertex with maximum degree. A vertex with maximum degree needs a color and all Δ(G) edges incident to this vertex need more Δ(G) + 1 distinct colors. To color all vertices and all edges of G, it requires at least Δ(G) + 1 colors. That is, χ"(G) is at least Δ(G) + 1. However, no one can find a graph G with the total chromatic number which is greater than Δ(G) + 2. The Total Coloring Conjecture states that for every graph G, χ"(G) is at most Δ(G) + 2. In this paper, we prove that the Total Coloring Conjectur for a Δ-claw-free 3-degenerated graph. That is, we prove that the total chromatic number of every Δ-claw-free 3-degenerated graph is at most Δ(G) + 2.

Keywords: total colorings, the total chromatic number, 3-degenerated, CLAW-FREE

Procedia PDF Downloads 174

Authors: Nidal Ali

Abstract:

Consider an algebraic number field K of degree n, A0 K is its ring of integers and a prime number p inert in K. Let F(u1, . . . , un, x) be the generic polynomial of integers of K. We will study in advance the stability of this polynomial and then, we will apply it in order to obtain all the monic irreducible polynomials in Fp[x] of degree d dividing n.

Keywords: generic polynomial, irreducibility, iteration, stability, inert prime, totally ramified

Procedia PDF Downloads 346

Authors: Natalia Naoumova

Abstract:

Facing changes and continuous growth of the contemporary cities, along with the globalization effects that accelerate cultural dissolution, the maintenance of cultural authenticity, which is implicit in historical areas as a part of cultural diversity, can be considered one of the key elements of a sustainable society. This article focuses on the polychromy of buildings in a historical context as an important feature of urban settings. It analyses the coloring of Brazilian urban heritage, characterized by the study of historical districts in Pelotas and Piratini, located in the State of Rio Grande do Sul, Brazil. The objective is to reveal the coloring characteristics of different historical periods, determine the chromatic typologies of the corresponding building styles, and clarify the connection between the historical chromatic aspects and their relationship with the contemporary urban identity. Architectural style data were collected by different techniques such as stratigraphic prospects of buildings, survey of historical records and descriptions, analysis of images and study of projects with colored facades kept in historical archives. Three groups of characteristics were considered in searching for working criteria in the formation of chromatic model typologies: 1) coloring palette; 2) morphology of the facade, and 3) their relationship. The performed analysis shows the formation of the urban chromatic image of the historical center as a continuous and dynamic process with the development of constant chromatic resources. It establishes that the changes in the formal language of subsequent historical periods lead to the changes in the chromatic schemes, providing a different reading of the facades both in terms of formal interpretation and symbolic meaning.

Keywords: building style, historic colors, urban heritage, urban polychromy

Procedia PDF Downloads 142

Authors: Soner Nandappa D., Ahmed Mohammed Naji

Abstract:

In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 549

Authors: S. Olyaee, M. Seifouri, A. Nikoosohbat, M. Shams Esfand Abadi

Abstract:

Photonic Crystal Fibers (PCFs) can be used in optical communications as transmission lines. For this reason, the PCFs with low confinement loss, low chromatic dispersion, and low nonlinear effects are highly suitable transmission media. In this paper, we introduce a new design of index-guiding nanostructured photonic crystal fiber (IG-NPCF) with ultra-low chromatic dispersion, low nonlinearity effects, and low confinement loss. Relatively low dispersion is achieved in the wavelength range of 1200 to 1600nm using the proposed design. According to the new structure of nanostructured PCF presented in this study, the chromatic dispersion slope is -30(ps/km.nm) and the confinement loss reaches below 10-7 dB/km. While in the wavelength range mentioned above at the same time an effective area of more than 50.2μm2 is obtained.

Keywords: optical communication systems, nanostructured, index-guiding, dispersion, confinement loss, photonic crystal fiber

Procedia PDF Downloads 560

Authors: Abdul Jalil M. Khalaf, Esraa M. Kadhim

Abstract:

The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x= 1 is equal to the Wiener index and second derivative at x=1 is equal to the Hyper-Wiener index. In this paper we study the Hosoya polynomial of zero-divisor graphs.

Keywords: Hosoya polynomial, wiener index, Hyper-Wiener index, zero-divisor graphs

Procedia PDF Downloads 530

Authors: Suparman

Abstract:

Piecewise polynomial regression model is very flexible model for modeling the data. If the piecewise polynomial regression model is matched against the data, its parameters are not generally known. This paper studies the parameter estimation problem of piecewise polynomial regression model. The method which is used to estimate the parameters of the piecewise polynomial regression model is Bayesian method. Unfortunately, the Bayes estimator cannot be found analytically. Reversible jump MCMC algorithm is proposed to solve this problem. Reversible jump MCMC algorithm generates the Markov chain that converges to the limit distribution of the posterior distribution of piecewise polynomial regression model parameter. The resulting Markov chain is used to calculate the Bayes estimator for the parameters of piecewise polynomial regression model.

Keywords: piecewise regression, bayesian, reversible jump MCMC, segmentation

Procedia PDF Downloads 373

Authors: Muhammad Faiz Liew Abdullah, Bhagwan Das, Nor Shahida, Abdul Fattah Chandio

Abstract:

This study presents the designed features of Graphical User Interface (GUI) for chromatic dispersion (CD) reduction using digital signal processing (DSP) techniques. GUI is specially designed for windows platform. The obtained simulation results from matlab are presented via this GUI. After importing results from matlab in GUI, It will present your work on any windows7 and onwards versions platforms without matlab software. First part of the GUI contains the research methodology block diagram and in the second part, output for each stage is shown in separate reserved area for the result display. Each stage of methodology has the captions to display the results. This GUI will be very helpful during presentations instead of making slides this GUI will present all your work easily in the absence of other software’s such as Matlab, Labview, MS PowerPoint. GUI is designed using C programming in MS Visio Studio.

Keywords: Matlab simulation results, C programming, MS VISIO studio, chromatic dispersion

Procedia PDF Downloads 462

Authors: Madina Hamiane

Abstract:

Modelling and simulation of an analogy function generator is presented based on a polynomial expansion model. The proposed function generator model is based on a 10th order polynomial approximation of any of the required functions. The polynomial approximations of these functions can then be implemented using basic CMOS circuit blocks. In this paper, a circuit model is proposed that can simultaneously generate many different mathematical functions. The circuit model is designed and simulated with HSPICE and its performance is demonstrated through the simulation of a number of non-linear functions.

Keywords: modelling and simulation, analog function generator, polynomial approximation, CMOS transistors

Procedia PDF Downloads 458

Authors: Shahrokh Barati

Abstract:

In this paper, we introduced AIDS disease at first, then proposed dynamic model illustrate its progress, after expression of a short history of nonlinear modeling by polynomial phasing systems, we considered the stability conditions of the systems, which contained a huge amount of researches in order to modeling and control of AIDS in dynamic nonlinear form, in this approach using a frame work of control any polynomial phasing modeling system which have been generalized by part of phasing model of T-S, in order to control the system in better way, the stability conditions were achieved based on polynomial functions, then we focused to design the appropriate controller, firstly we considered the equilibrium points of system and their conditions and in order to examine changes in the parameters, we presented polynomial phase model that was the generalized approach rather than previous Takagi Sugeno models, then with using case we evaluated the equations in both open loop and close loop and with helping the controlling feedback, the close loop equations of system were calculated, to simulate nonlinear model of AIDS disease, we used polynomial phasing controller output that was capable to make the parameters of a nonlinear system to follow a sustainable reference model properly.

Keywords: polynomial fuzzy, AIDS, nonlinear AIDS model, fuzzy control systems

Procedia PDF Downloads 468

Authors: Manisha Kankarej

Abstract:

The purpose of this paper is to show a relation between CR structure and F-structure satisfying polynomial equation. In this paper, we have checked the significance of CR structure and F-structure on Integrability conditions and Nijenhuis tensor. It was proved that all the properties of Integrability conditions and Nijenhuis tensor are satisfied by CR structures and F-structure satisfying polynomial equation.

Keywords: CR-submainfolds, CR-structure, integrability condition, Nijenhuis tensor

Procedia PDF Downloads 525

Authors: Tsun-Hui Huang, Shyue-Cheng Yang, Chiou-Fen Shieha

Abstract:

In this paper, a nonlinear constitutive law and a curve fitting, two relationships between the stress-strain and the shear stress-strain for sandstone material were used to obtain a second-order polynomial constitutive equation. Based on the established polynomial constitutive equations and Newton’s second law, a mathematical model of the non-homogeneous nonlinear wave equation under an external pressure was derived. The external pressure can be assumed as an impulse function to simulate a real earthquake source. A displacement response under nonlinear two-dimensional wave equation was determined by a numerical method and computer-aided software. The results show that a suit pressure in the sandstone generates the phenomenon of stress solitary waves.

Keywords: polynomial constitutive equation, solitary, stress solitary waves, nonlinear constitutive law

Procedia PDF Downloads 497

Authors: Zuhier Altawallbeh

Abstract:

In this paper, an explicit homotopic function is constructed to compute the Hochschild homology of a finite dimensional free k-module V. Because the polynomial algebra is of course fundamental in the computation of the Hochschild homology HH and the cyclic homology CH of commutative algebras, we concentrate our work to compute HH of the polynomial algebra.by providing certain homotopic function.

Keywords: hochschild homology, homotopic function, free and projective modules, free resolution, exterior algebra, symmetric algebra

Procedia PDF Downloads 405

Authors: Nevena Jakovčević Stor, Ivan Slapničar

Abstract:

Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method.

Keywords: roots of polynomials, eigenvalue decomposition, arrowhead matrix, high relative accuracy

Procedia PDF Downloads 417

Authors: A. Brouri, F. Giri, A. Mkhida, A. Elkarkri, M. L. Chhibat

Abstract:

Standard Hammerstein-Wiener models consist of a linear subsystem sandwiched by two memoryless nonlinearities. Presently, the linear subsystem is allowed to be parametric or not, continuous- or discrete-time. The input and output nonlinearities are polynomial and may be noninvertible. A two-stage identification method is developed such the parameters of all nonlinear elements are estimated first using the Kozen-Landau polynomial decomposition algorithm. The obtained estimates are then based upon in the identification of the linear subsystem, making use of suitable pre-ad post-compensators.

Keywords: nonlinear system identification, Hammerstein-Wiener systems, frequency identification, polynomial decomposition

Procedia PDF Downloads 511

Authors: Ayubi Wirara, Ardya Suryadinata

Abstract:

Improper application of the RSA algorithm scheme can cause vulnerability to attacks. The attack utilizes the relationship between broadcast messages sent to the user with some fixed polynomial functions that belong to each user. Scheme attacks carried out by applying the Chinese Remainder Theorem to obtain a general polynomial equation with the same modulus. The formation of the general polynomial becomes a first step to get back the original message. Furthermore, to solve these equations can use Coppersmith's theorem.

Keywords: RSA algorithm, broadcast message, Chinese Remainder Theorem, Coppersmith’s theorem

Procedia PDF Downloads 341

Authors: Özgür Tan

Abstract:

In different fields of industry, there is a huge demand to acquire surface information in the dimension of micrometer up to centimeter in order to characterize functional behavior of products. Thanks to the latest developments, there are now different methods in surface metrology, but it is not possible to find a unique measurement technique which fulfils all the requirements. Depending on the interaction with the surface, regardless of optical or tactile, every method has its own advantages and disadvantages which are given by nature. However new concepts like ‘multi-sensor’, tools in surface metrology can be improved to solve most of the requirements simultaneously. In this paper, after having presented different optical techniques like confocal microscopy, focus variation and white light interferometry, a new approach is presented which combines white-light interferometry with chromatic confocal probing in a single product. Advantages of different techniques can be used for challenging applications.

Keywords: flatness, chromatic confocal, optical surface metrology, roughness, white-light interferometry

Procedia PDF Downloads 260

Authors: Suad M. Abuzariba, Liang Chen, Saeed Hadjifaradji

Abstract:

To evaluate the optical eye diagram due to polarization-mode dispersion (PMD), polarization-dependent loss (PDL), and chromatic dispersion (CD) for a system of highly mode coupled fiber with lumped section at any given optical pulse sequence we present an analytical modle. We found that with considering PDL and the polarization direction correlation between PMD and PDL, a system with highly mode coupled fiber with lumped section can have either higher or lower Q-factor than a highly mode coupled system with same root mean square PDL/PMD values. Also we noticed that a system of two highly mode coupled fibers connected together is not equivalent to a system of highly mode coupled fiber when fluctuation is considered

Keywords: polarization mode dispersion, polarization dependent loss, chromatic dispersion, optical eye diagram

Procedia PDF Downloads 865

Authors: Ogunrinde Roseline Bosede

Abstract:

This paper presents the development, analysis and implementation of an inverse polynomial numerical method which is well suitable for solving initial value problems in first order ordinary differential equations with applications to sample problems. We also present some basic concepts and fundamental theories which are vital to the analysis of the scheme. We analyzed the consistency, convergence, and stability properties of the scheme. Numerical experiments were carried out and the results compared with the theoretical or exact solution and the algorithm was later coded using MATLAB programming language.

Keywords: differential equations, numerical, polynomial, initial value problem, differential equation

Procedia PDF Downloads 447

Authors: Manish Kumar Asthana, Alicia Bundis, Zahn Xu, Braj Bhushan

Abstract:

Despite ample cross-cultural studies with emotional valence, it is unclear if the emotions are universal or particular. Previous studies have shown that the individualist culture favors high-valence emotions compared to low-valence emotions. In contrast, collectivist culture favors low-valence emotions compared to high-valence emotions. In this current study, Chinese, Mexicans, and Indians reported valence and semantic-contingency. In total, 120 healthy participants were selected by ethnicity and matched for age and education. Each participant was presented 45 non-chromatic pictures, which were converted from chromatic pictures selected from International Affective Picture Database (IAPS) belonging to five-categories, i.e. (i) less pleasant, (ii) high pleasant, (iii) less unpleasant (iv) high unpleasant (v) neutral. The valence scores assigned to neutral, less-unpleasant, and high-pleasant pictures differed significantly between Chinese, Indian, and Mexicans participants. Significant effects demonstrated from the two-way ANOVAs, confirmed main significant effects of valence (F(1,117) = 24.83, p =0.000) and valence x country (F(2,117) = 2.74, p = 0.035). Significant effects emerging from the one-way ANOVAs were followed up through Bonferroni’s test post-hoc comparisons (p < 0.01). This analysis showed significant effect of neutral (F(2,119) = 6.50, p =0.002), less-unpleasant (F(2,119) = 13.79, p =0.000), and high-unpleasant (F(2,119) = 5.99, p =0.003). There were no significant differences in valence scores for the less-pleasant and more-pleasant between participants from three countries. The IAPS norms require modification for their appropriate application in individualist and collectivist cultures.

Keywords: cultural difference, affective processing, valence, non-chromatic, international affective picture system (IAPS)

Procedia PDF Downloads 140

Authors: Wajdi Mohamed Ratemi

Abstract:

The very well-known stacked sets of numbers referred to as Pascal’s triangle present the coefficients of the binomial expansion of the form (x+y)n. This paper presents an approach (the Staircase Horizontal Vertical, SHV-method) to the generalization of planar Pascal’s triangle for polynomial expansion of the form (x+y+z+w+r+⋯)n. The presented generalization of Pascal’s triangle is different from other generalizations of Pascal’s triangles given in the literature. The coefficients of the generalized Pascal’s triangles, presented in this work, are generated by inspection, using embedded Pascal’s triangles. The coefficients of I-variables expansion are generated by horizontally laying out the Pascal’s elements of (I-1) variables expansion, in a staircase manner, and multiplying them with the relevant columns of vertically laid out classical Pascal’s elements, hence avoiding factorial calculations for generating the coefficients of the polynomial expansion. Furthermore, the classical Pascal’s triangle has some pattern built into it regarding its odd and even numbers. Such pattern is known as the Sierpinski’s triangle. In this study, a presentation of Sierpinski-like patterns of the generalized Pascal’s triangles is given. Applications related to those coefficients of the binomial expansion (Pascal’s triangle), or polynomial expansion (generalized Pascal’s triangles) can be in areas of combinatorics, and probabilities.

Keywords: pascal’s triangle, generalized pascal’s triangle, polynomial expansion, sierpinski’s triangle, combinatorics, probabilities

Procedia PDF Downloads 367