Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Shariefuddin Pirzada
University of Kashmir
Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
On scores, losing scores and total scores in hypertournaments Shariefuddin Pirzada; Muhammad Ali Khan; Zhou Guofei; Koko K Kayibi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 3, No 1 (2015): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2015.3.1.2

Abstract

A $k$-hypertournament is a complete $k$-hypergraph with each $k$-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a $k$-hypertournament, the score $s_{i}$ (losing score $r_{i}$) of a vertex $v_{i}$ is the number of arcs containing $v_{i}$ in which $v_{i}$ is not the last element (in which $v_{i}$ is the last element). The total score of $v_{i}$ is defined as $t_{i}=s_{i}-r_{i}$. In this paper we obtain stronger inequalities for the quantities $\sum_{i\in I}r_{i}$, $\sum_{i\in I}s_{i}$ and $\sum_{i\in I}t_{i}$, where $I\subseteq \{ 1,2,\ldots,n\}$. Furthermore, we discuss the case of equality for these inequalities. We also characterize total score sequences of strong $k$-hypertournaments.
On energy, Laplacian energy and $p$-fold graphs Hilal A Ganie; Shariefuddin Pirzada; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 3, No 1 (2015): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2015.3.1.10

Abstract

For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ and the Laplacian energy is defined as $LE(G)=\sum_{i=1}^{n}|\mu_i-\frac{2m}{n}|$. In this paper, we give upper and lower bounds for the energy of $KK_n^j,~1\leq j \leq n$ and as a consequence we generalize a result of Stevanovic et al. [More on the relation between Energy and Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem. {\bf 61} (2009) 395-401]. We also consider strong double graph and strong $p$-fold graph to construct some new families of graphs $G$ for which $E(G)> LE(G)$.
Co-Authors Edy Tri Baskoro Hilal A Ganie Koko K Kayibi Muhammad Ali Khan Zhou Guofei