Let be a graph with vertex set . The number of vertices in is the order of and is denoted by . The connected hub polynomial of Gdenoted by is defined as where denotes the number of connected hub sets of of cardinality and denotes the connected hub number of .Let denotes the Lollipop graph with vertices. The connected hub polynomial of denoted by is defined as,where denotes the number of connected hub sets of of cardinality , and denotes the connected hub number of .In this paper, we derive a recursive formula for . From this recursive formula, we construct the connected hub polynomial of as,Also we study some properties of this polynomia
In this paper another fundamental change in particular SEE change was applied to address straight no...
We show an alternative proof of an identity given by Persson-Strang for the well known Legendre poly...
لقد تم تقديم التطبيقات الئنائية المنظمة في فضاءات الوحدات المحدبة الحقيقية ثم برهنا بعض خواصها...
Let be a graph with vertex set . The number of vertices in is the order of and is denoted by . Th...
Let be a simple graph.Let be the family of connected 2 dominating sets in with cardinality and |....
Let be a graph with vertices and edges. An labeling of graph is a function of such that the ...
This article elaborates about a novel approach on defining θ-open sets and some of its properties in...
We constructed a θ-finite difference method to get the numerical solution for nonlinear couple syste...
The object of this paper is to obtain a common unique fixed point theorem for two continuous random ...
Let G=(V(G), E(G)) be a path or cycle graph. A subset D of V(G) is a dominating set of G if for ever...
A pair (U,V) of Hermitian regular linear functionals on the unit circle is said to be a (1, 1)-coher...
We provide exact formulae for the rational Bézier representation of caustics of planar Bézier curves...
An edge anti-magic total labelling, -EAMT, on graph with vertices and edges is bijektion , which...
In this paper we introduce the concept of connected vertex strong geodetic number\ cg_{sx}(G) of a g...
في هذا البحث، سنثبت مبرهنات نقاط التطابق لزوجين من التطبيقات معرفة على مجموعة جزﺋية غير خالية...
In this paper another fundamental change in particular SEE change was applied to address straight no...
We show an alternative proof of an identity given by Persson-Strang for the well known Legendre poly...
لقد تم تقديم التطبيقات الئنائية المنظمة في فضاءات الوحدات المحدبة الحقيقية ثم برهنا بعض خواصها...
Let be a graph with vertex set . The number of vertices in is the order of and is denoted by . Th...
Let be a simple graph.Let be the family of connected 2 dominating sets in with cardinality and |....
Let be a graph with vertices and edges. An labeling of graph is a function of such that the ...
This article elaborates about a novel approach on defining θ-open sets and some of its properties in...
We constructed a θ-finite difference method to get the numerical solution for nonlinear couple syste...
The object of this paper is to obtain a common unique fixed point theorem for two continuous random ...
Let G=(V(G), E(G)) be a path or cycle graph. A subset D of V(G) is a dominating set of G if for ever...
A pair (U,V) of Hermitian regular linear functionals on the unit circle is said to be a (1, 1)-coher...
We provide exact formulae for the rational Bézier representation of caustics of planar Bézier curves...
An edge anti-magic total labelling, -EAMT, on graph with vertices and edges is bijektion , which...
In this paper we introduce the concept of connected vertex strong geodetic number\ cg_{sx}(G) of a g...
في هذا البحث، سنثبت مبرهنات نقاط التطابق لزوجين من التطبيقات معرفة على مجموعة جزﺋية غير خالية...
In this paper another fundamental change in particular SEE change was applied to address straight no...
We show an alternative proof of an identity given by Persson-Strang for the well known Legendre poly...
لقد تم تقديم التطبيقات الئنائية المنظمة في فضاءات الوحدات المحدبة الحقيقية ثم برهنا بعض خواصها...