Preferred Language
Articles
/
bsj-6350
Detour Polynomials of Generalized Vertex Identified of Graphs
...Show More Authors

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

 

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Jan 01 2020
Journal Name
Cogent Engineering
On the computational aspects of Charlier polynomials
...Show More Authors

View Publication
Scopus (35)
Crossref (33)
Scopus Clarivate Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Some Properties of Fuzzy Neutrosophic Generalized Semi Continuous Mapping and Alpha Generalized Continuous Mapping
...Show More Authors

 In the current study, the definition of mapping of fuzzy neutrosophic generalized semi-continuous and fuzzy neutrosophic alpha has generalized mapping as continuous. The study confirmed some theorems regarding such a concept. In the following, it has been found relationships among fuzzy neutrosophic alpha generalized mapping as continuous, fuzzy neutrosophic mapping as continuous, fuzzy neutrosophic alpha mapping as continuous, fuzzy neutrosophic generalized semi mapping as continuous, fuzzy neutrosophic pre mapping as continuous and fuzzy neutrosophic γ mapping as continuous.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Third Order Differential Subordination for Analytic Functions Involving Convolution Operator
...Show More Authors

       In the present paper, by making use of the new generalized operator, some results of third order differential subordination and differential superordination consequence for analytic functions are obtained. Also, some sandwich-type theorems are presented.

View Publication Preview PDF
Scopus (7)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of Computer Sciences
Connectedness in Graphs and Gm-Closure Spaces
...Show More Authors

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

Preview PDF
Publication Date
Sun May 16 2021
Journal Name
Graphs And Combinatorics
Commuting Involution Graphs for Certain Exceptional Groups of Lie Type
...Show More Authors
Abstract<p>Suppose that <italic>G</italic> is a finite group and <italic>X</italic> is a <italic>G</italic>-conjugacy classes of involutions. The commuting involution graph <inline-formula><alternatives><tex-math>$${\mathcal {C}}(G,X)$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>C</mi> <mo>(</mo> <mi>G</mi> <mo>,</mo> <mi>X</mi> <mo>)</mo> </mrow> </math></alternatives></inline-formula> is</p> ... Show More
View Publication
Scopus (4)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Mon Sep 21 2020
Journal Name
Iraqi Journal For Electrical And Electronic Engineering
Emotion Recognition Based on Mining Sub-Graphs of Facial Components
...Show More Authors

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Apr 26 2021
Journal Name
Journal Of Real-time Image Processing
Fast and efficient recursive algorithm of Meixner polynomials
...Show More Authors

View Publication
Scopus (32)
Crossref (28)
Scopus Clarivate Crossref
Publication Date
Tue Mar 03 2009
Journal Name
Journal Of Economics And Administrative Sciences
Comparison of repetitive estimation methodsSelf-data
...Show More Authors

In this study, we review the ARIMA (p, d, q), the EWMA and the DLM (dynamic linear moodelling) procedures in brief in order to accomdate the ac(autocorrelation)  structure of data .We consider the recursive estimation and prediction algorithms based on Bayes and KF (Kalman filtering) techniques for correlated observations.We investigate the effect on the MSE of  these procedures and compare them using generated data.

View Publication Preview PDF
Crossref
Publication Date
Sat Sep 01 2007
Journal Name
Al-khwarizmi Engineering Journal
Flutter Speed Limits of Cantilever Rectangular and Tapered Plates
...Show More Authors

The aerodynamic and elastic forces may cause an oscillation of the structure such as the high frequency of the airfoil surfaces and the dynamic instability occurring in an aircraft in flight and failure may occur at a speed called flutter speed. In this work, analytical and numerical investigations of flutter limits of thin plates have been carried out. The flutter speed of rectangular plates were obtained and compared with some published results. Different design parameters were investigated such as aspect ratio, thickness and their effects on flutter velocity. It was found that the structural mode shape plays an important role in the determination of the flutter speed and the coupling between the bending and torsional mode is the main

... Show More
View Publication Preview PDF
Publication Date
Tue Dec 05 2023
Journal Name
Baghdad Science Journal
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
...Show More Authors

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

View Publication Preview PDF
Scopus (1)
Scopus Crossref