scholarly journals Recurrence Relations and Splitting Formulas for the Domination Polynomial

10.37236/2475 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Tomer Kotek ◽  
James Preen ◽  
Frank Simon ◽  
Peter Tittmann ◽  
Martin Trinks
Keyword(s):  
Generating Function ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Dominating Sets ◽  
Special Cases ◽  
Wide Range ◽  
Domination Polynomial ◽  
Arbitrary Graphs

The domination polynomial $D(G,x)$ of a graph $G$ is the generating function of its dominating sets. We prove that $D(G,x)$ satisfies a wide range of reduction formulas. We show linear recurrence relations for $D(G,x)$ for arbitrary graphs and for various special cases. We give splitting formulas for $D(G,x)$ based on articulation vertices, and more generally, on splitting sets of vertices.

Numerical solutions and analysis of diffusion for new generalized fractional Burgers equation

2013 ◽  
Vol 16 (3) ◽  
Author(s):  
Yufeng Xu ◽  
Om Agrawal
Keyword(s):  
Finite Difference ◽  
Diffusion Process ◽  
Weight Function ◽  
Numerical Solutions ◽  
Burgers Equation ◽  
Weight Functions ◽  
Linear Recurrence ◽  
Scale Function ◽  
Special Cases ◽  
Wide Range

AbstractIn this paper, numerical solutions of Burgers equation defined by using a new Generalized Time-Fractional Derivative (GTFD) are discussed. The numerical scheme uses a finite difference method. The new GTFD is defined using a scale function and a weight function. Many existing fractional derivatives are the special cases of it. A linear recurrence relationship for the numerical solutions of the resulting system of linear equations is found via finite difference approach. Burgers equations with different fractional orders and coefficients are computed which show that this numerical method is simple and effective, and is capable of solving the Burgers equation accurately for a wide range of viscosity values. Furthermore, we study the influence of the scale and the weight functions on the diffusion process of Burgers equation. Numerical simulations illustrate that a scale function can stretch or contract the diffusion on the time domain, while a weight function can change the decay velocity of the diffusion process.

scholarly journals On the domination polynomial of a digraph: a generation function approach

2021 ◽  
Vol 40 (6) ◽  
pp. 1587-1602
Author(s):  
Jorge Alencar ◽  
Leonardo de Lima
Keyword(s):  
Directed Graph ◽  
Generating Function ◽  
Dominating Set ◽  
Function Approach ◽  
Dominating Sets ◽  
Generation Function ◽  
Domination Polynomial

Let G be a directed graph on n vertices. The domination polynomial of G is the polynomial D(G, x) =∑ni=0 d(G, i)xi, where d(G, i) is the number of dominating sets of G with i vertices. In this paper, we prove that the domination polynomial of G can be obtained by using an ordinary generating function. Besides, we show that our method is useful to obtain the minimum-weighted dominating set of a graph.

scholarly journals A class of orthogonal polynomials of a new type

1983 ◽  
Vol 6 (1) ◽  
pp. 171-180
Author(s):  
M. Dutta ◽  
Kanchan Prabha Manocha
Keyword(s):  
Positive Integer ◽  
Differential Equations ◽  
Orthogonal Polynomials ◽  
Generating Function ◽  
Recurrence Relations ◽  
Variable Parameter ◽  
Negative Integer ◽  
Special Cases ◽  
New Type ◽  
Fixed Positive Integer

The purpose of this paper is to study a class of polynomialsFnm(x,λ,ν)associated with a class ofmdifferential equations, whereλis fixed,nis a variable parameter,mis fixed positive integer andνis a non-negative integer<m. We also obtain all the important properties of this class of polynomials including Rodrigues' formulas, generating function, and recurrence relations. Several special cases of interest are obtained from our analysis.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

scholarly journals On Exact Sampling of Nonnegative Infinitely Divisible Random Variables

2012 ◽  
Vol 44 (3) ◽  
pp. 842-873 ◽  
Author(s):  
Zhiyi Chi
Keyword(s):  
Basic Result ◽  
Random Variables ◽  
Random Variable ◽  
Fixed Number ◽  
Rejection Sampling ◽  
Infinitely Divisible ◽  
Exact Sampling ◽  
Special Cases ◽  
Wide Range ◽  
Lévy Density

Nonnegative infinitely divisible (i.d.) random variables form an important class of random variables. However, when this type of random variable is specified via Lévy densities that have infinite integrals on (0, ∞), except for some special cases, exact sampling is unknown. We present a method that can sample a rather wide range of such i.d. random variables. A basic result is that, for any nonnegative i.d. random variable X with its Lévy density explicitly specified, if its distribution conditional on X ≤ r can be sampled exactly, where r > 0 is any fixed number, then X can be sampled exactly using rejection sampling, without knowing the explicit expression of the density of X. We show that variations of the result can be used to sample various nonnegative i.d. random variables.

Inner-product theory calculations for some rational potentials in a three-dimensional system

1996 ◽  
Vol 74 (1-2) ◽  
pp. 4-9
Author(s):  
M. R. M. Witwit
Keyword(s):  
Energy Levels ◽  
Three Dimensional ◽  
Inner Product ◽  
Dimensional System ◽  
Product Technique ◽  
Special Cases ◽  
Wide Range ◽  
Perturbation Parameters ◽  
Three Dimensional System ◽  
Range Of Values

The energy levels of a three-dimensional system are calculated for the rational potentials,[Formula: see text]using the inner-product technique over a wide range of values of the perturbation parameters (λ, g) and for various eigenstates. The numerical results for some special cases agree with those of previous workers where available.

scholarly journals The truncated Hyper-Poisson queues: Hk/Ma,b/C/N with balking, reneging and general bulk service rule

2008 ◽  
Vol 18 (1) ◽  
pp. 23-36 ◽  
Author(s):  
A.I. Shawky ◽  
M.S. El-Paoumy
Keyword(s):  
Steady State ◽  
Analytical Solution ◽  
Explicit Form ◽  
Recurrence Relations ◽  
Expected Number ◽  
Special Cases ◽  
Queue Discipline ◽  
Bulk Service ◽  
General Bulk Service Rule ◽  
Steady State Probabilities

The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I) units arrive according to a hyper-Poisson distribution with k independent branches, (II) the queue discipline is FIFO; and (III) the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .

scholarly journals On Sums of Cubes of Generalized Fibonacci Numbers: Closed Formulas of Σn k=0 kW3 k and Σn k=1 kW3− k

2020 ◽  
pp. 37-52 ◽  
Author(s):  
Yuksel Soykan
Keyword(s):  
Recurrence Relations ◽  
Fibonacci Numbers ◽  
Second Order ◽  
Lucas Numbers ◽  
Generalized Fibonacci Numbers ◽  
Special Cases

In this paper, closed forms of the sum formulas Σn k=0 kW3 k and Σn k=1 kW3-k for the cubes of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Our work generalize second order recurrence relations.

scholarly journals A method for decision making with the OWA operator

2012 ◽  
Vol 9 (1) ◽  
pp. 357-380 ◽  
Author(s):  
José Merigó ◽  
Anna Gil-Lafuente
Keyword(s):  
Decision Making ◽  
Distance Measures ◽  
Weighted Averaging ◽  
Owa Operator ◽  
Minimum Level ◽  
Ordered Weighted Averaging ◽  
Special Cases ◽  
Wide Range ◽  
Decision Making Problem ◽  
Parameterized Family

A new method for decision making that uses the ordered weighted averaging (OWA) operator in the aggregation of the information is presented. It is used a concept that it is known in the literature as the index of maximum and minimum level (IMAM). This index is based on distance measures and other techniques that are useful for decision making. By using the OWA operator in the IMAM, we form a new aggregation operator that we call the ordered weighted averaging index of maximum and minimum level (OWAIMAM) operator. The main advantage is that it provides a parameterized family of aggregation operators between the minimum and the maximum and a wide range of special cases. Then, the decision maker may take decisions according to his degree of optimism and considering ideals in the decision process. A further extension of this approach is presented by using hybrid averages and Choquet integrals. We also develop an application of the new approach in a multi-person decision-making problem regarding the selection of strategies.

Sign in / Sign up

Export Citation Format

Share Document