#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2009

2016

- This year (0)
- Last 5 years (12)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Muhammad Imran, Syed Ahtsham Ul Haq Bokhary, Abdul Qudair Baig
- Computers & Mathematics with Applications
- 2010

- Muhammad Imran, Abdul Qudair Baig, Syed Ahtsham Ul Haq Bokhary, Imran Javaid
- Appl. Math. Lett.
- 2012

- Murtaza Ali, Gohar Ali, Muhammad Imran, Abdul Qudair Baig, Muhammad Kashif Shafiq
- Ars Comb.
- 2012

- Abdul Qudair Baig, Edy Tri Baskoro, Andrea Semanicová-Fenovcíková
- Ars Comb.
- 2014

- Abdul Qudair Baig, Muhammad Javaid, Abdul Raheem
- Discussiones Mathematicae Graph Theory
- 2015

Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the support of this conjecture, the present paper deals with different results on super (a, d)-edge-antimagic total labeling of subdivided stars for d ∈… (More)

July-August ON SUPER (a, d) -EAT LABELING OF SUBDIVIDED TREES A. Raheem, A. Q. Baig and M. Javaid Department of Mathematics, COMSATS Institute of information Technology, Islamabad, Pakistan Department of Mathematics, COMSATS Institute of Information Technology, Attock, Pakistan School of Mathematical Sciences, University of Science and Technology of China,… (More)

- M. Khurram Zafar, Abdul Qudair Baig, Muhammad Imran, Andrea Semaničová–Feňovčı́ková
- 2014

The energy of a graph is the sum of the eigenvalues of its adjacency matrix. In this paper, we are interested in how the energy of a graph changes when edges in a graph are added or removed. We prove that the energy of a graph is increased or decreased. The energy of the graph depend upon edges due to edge addition or deletion. In this paper we are dealing… (More)

- Muhammad Imran, Abdul Qudair Baig, Haidar Ali, Shafiq ur Réhman
- Periodica Mathematica Hungarica
- 2016

- Muhammad Imran, Abdul Qudair Baig, Syed Ahtsham Ul Haq Bokhary
- Ars Comb.
- 2016

For given graphs G and H; the Ramsey number R(G;H) is the least<lb>natural number n such that for every graph F of order n the following<lb>condition holds: either F contains G or the complement of F contains H.<lb>In this paper firstly, we determine Ramsey number for union of paths<lb>with respect to sunflower graphs, For m ≥ 3, the sunflower graph… (More)