Obaidullah Wardak

Mr. Obaidullah Wardak

South Asian University, New Delhi, Delhi, International
+1
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 July 2023 in Indian Journal of Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
Obaidullah WardakObaidullah Wardak
Obaidullah Wardak
DSDeepa Sinha
Deepa Sinha
ASAnshu Sethi
Anshu Sethi

27 July 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
DSDeepa Sinha
Deepa Sinha
Obaidullah WardakObaidullah Wardak
Obaidullah Wardak
ADAyushi Dhama
Ayushi Dhama
We define the signed Cayley graph on Cayley graph Xn denoted by Sn, and study several properties such as balancing, clusterability and sign-compatibility of the signed Cayley graph Sn. Apart from it we also study the characterization of the canonical consistency of Sn, for some n.

25 September 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
Obaidullah WardakObaidullah Wardak
Obaidullah Wardak
ADAyushi Dhama
Ayushi Dhama
DSDeepa Sinha
Deepa Sinha
We define an addition signed Cayley graph on a unitary addition Cayley graph Gn represented by Σn∧, and study several properties such as balancing, clusterability and sign compatibility of the addition signed Cayley graph Σn∧. We also study the characterization of canonical consistency of Σn∧, for some n.

21 July 2022 in MethodsX
Verified
Journal Article
Open access
ASAnshu Sethi
Anshu Sethi
DSDeepa Sinha
Deepa Sinha
Obaidullah WardakObaidullah Wardak
Obaidullah Wardak
Common-Edge signed graph CE(S) of a signed graph S is a signed graph whose vertex-set is the pairs of adjacent edges in S and two vertices are adjacent if the corresponding pairs of adjacent edges of S have exactly one edge in common, with the sign same as that of Common-Edge. S-Marked signed graph T is a signed graph which receives the marking μ due to the signed graph S called marker. Further, T is S-consistent if a marker S is defined and if S-markingμof T with respect to which marked signed graph Tμ is consistent. In this paper, we give an algorithm to detect if CE(S) is S-consistent or not and determine its complexity.