مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Issue Information

Archive

Year

Volume(Issue)

Issues

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
Issue Info: 
  • Year: 

    2021
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    1-8
Measures: 
  • Citations: 

    0
  • Views: 

    21
  • Downloads: 

    2
Abstract: 

Let $G$ be an $n-$vertex graph with $m$ vertices‎. ‎The degree deviation measure of $G$ is defined as‎ ‎$s(G)$ $=$ $\sum_{v\in V(G)}|deg_G(v)‎- ‎\frac{2m}{n}|,$ where $n$ and $m$ are the number of vertices and edges of $G$‎, ‎respectively‎. ‎The aim of this paper is to prove the Conjecture 4.2 of [J‎. ‎A‎. ‎de Oliveira‎, ‎C‎. ‎S‎. ‎Oliveira‎, ‎C‎. ‎Justel and N‎. ‎M‎. ‎Maia de Abreu‎, ‎Measures of irregularity of graphs‎, Pesq‎. ‎Oper.‎, ‎33 (2013) 383--398]‎. ‎The degree deviation measure of chemical graphs under some conditions on the cyclomatic number is also computed‎.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 21

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 2 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2021
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    9-29
Measures: 
  • Citations: 

    0
  • Views: 

    41
  • Downloads: 

    5
Abstract: 

‎Given a simple graph $G$‎, ‎the distance signlesss Laplacian‎ ‎$D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix‎ ‎$Tr(G)$ and distance matrix $D(G)$‎. ‎In this paper‎, ‎thanks to the‎ ‎symmetry of $D^{Q}(G)$‎, ‎we obtain novel sharp bounds on the distance‎ ‎signless Laplacian eigenvalues of $G$‎, ‎and in particular the‎ ‎distance signless Laplacian spectral radius‎. ‎The bounds are‎ ‎expressed through graph diameter‎, ‎vertex covering number‎, ‎edge‎ ‎covering number‎, ‎clique number‎, ‎independence number‎, ‎domination‎ ‎number as well as extremal transmission degrees‎. ‎The graphs‎ ‎achieving the corresponding bounds are delineated‎. ‎In addition‎, ‎we‎ ‎investigate the distance signless Laplacian spectrum induced by‎ ‎Indu-Bala product‎, ‎Cartesian product as well as extended double‎ ‎cover graph‎.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 41

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 5 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Egecloglu Omer

Issue Info: 
  • Year: 

    2021
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    31-42
Measures: 
  • Citations: 

    0
  • Views: 

    58
  • Downloads: 

    3
Abstract: 

We study two foremost Mahonian statistics, the major index and the inversion number for a class of binary words called restricted Fibonacci words. The language of restricted Fibonacci words satisfies recurrences which allow for the calculation of the generating functions in two different ways. These yield identities involving the $q$-binomial coefficients and provide non-standard $q$-analogues of the Fibonacci numbers. The major index generating function for restricted Fibonacci words turns out to be a $q$-power multiple of the inversion generating function.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 58

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 3 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2021
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    43-61
Measures: 
  • Citations: 

    0
  • Views: 

    20
  • Downloads: 

    2
Abstract: 

Let $G = PSL_{2}(q)$‎, ‎where $q$ is a power of an odd prime‎. ‎Let $M$ be a maximal subgroup of $G$‎. ‎Define $\left\lbrace \frac{|M|}{|M \cap M^g|}‎: ‎g \in G \right\rbrace$ to be the set of orbit lengths of the primitive action of $G$ on the conjugates of a maximal subgroup $M$ of $G.$ By using a method described by Key and Moori in the literature‎, ‎we construct all primitive symmetric $1$-designs that admit $G$ as a permutation group of automorphisms‎.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 20

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 2 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2021
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    63-71
Measures: 
  • Citations: 

    0
  • Views: 

    20
  • Downloads: 

    1
Abstract: 

‎Let $G=(V,E)$ be a simple graph with $n\ge 3$ vertices‎, ‎$m$ edges‎ ‎and vertex degree sequence $\Delta=d_1 \ge d_2 \ge \cdots \ge‎ ‎d_n=\delta>0$‎. ‎Denote by $S=\{1, 2,\ldots,n\}$ an index set and by‎ ‎$J=\{I=(r_1, r_2,\ldots,r_k)‎, ‎| ‎,1\le r_1

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 20

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button