<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Mathematical Sciences and Informatics</title>
<title_fa>مجله علوم ریاضی و انفورماتیک</title_fa>
<short_title>IJMSI</short_title>
<subject>Basic Sciences</subject>
<web_url>http://ijmsi.ir</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>1735-4463</journal_id_issn>
<journal_id_issn_online>2008-9473</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>10.61882/ijmsi</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1405</year>
	<month>1</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2026</year>
	<month>4</month>
	<day>1</day>
</pubdate>
<volume>21</volume>
<number>1</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Graph Irregularity Characterization with Particular Regard to Bidegreed Graphs</title>
	<subject_fa>عمومى</subject_fa>
	<subject>General</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research paper</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p style=&quot;text-align: justify;&quot;&gt;In this study, we are interested mainly in investigating the relations between two graph irregularity measures which are widely used for structural irregularity characterization of connected graphs. Our study is focused on the comparison and evaluation of the discriminatory ability of irregularity measures called degree deviation S(G) and degree variance V ar(G). We establish various upper bounds for irregularity measures S(G) and V ar(G). It is shown that Nikiforov&amp;rsquo;s inequality which is valid for connected graphs can be sharpened in the form of V ar(G) &lt; S(G)/2. Among others, it is verified that if G is a bidegreed graph then the discrimination ability of S(G) and V ar(G) is considered to be completely equivalent.&lt;/p&gt;
&lt;s(g) 2.=&quot;&quot; a=&quot;&quot; ability=&quot;&quot; among=&quot;&quot; bidegreed=&quot;&quot; discrimination=&quot;&quot; g=&quot;&quot; graph=&quot;&quot; if=&quot;&quot; is=&quot;&quot; it=&quot;&quot; of=&quot;&quot; others=&quot;&quot; s=&quot;&quot; that=&quot;&quot; the=&quot;&quot; then=&quot;&quot; verified=&quot;&quot;&gt;&lt;/s(g)&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Irregularity measure, Degree deviation, Degree variance, Bidegreed graph.</keyword>
	<start_page>85</start_page>
	<end_page>105</end_page>
	<web_url>http://ijmsi.ir/browse.php?a_code=A-10-6995-1&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Ali</first_name>
	<middle_name></middle_name>
	<last_name>Ghalavand</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>alighalavand@grad.kashanu.ac.ir</email>
	<code>100319475328460012030</code>
	<orcid>100319475328460012030</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 87317-53153, I. R. Iran</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Tamás</first_name>
	<middle_name></middle_name>
	<last_name>Réti</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>reti.tamas@bgk.uni-obuda.hu</email>
	<code>100319475328460012031</code>
	<orcid>100319475328460012031</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Donát Bánki Faculty of Mechanical and Safety Engineering, Óbudá University, Népszínház u. 8, H-1081, Budapest, Hungary</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Igor Z.</first_name>
	<middle_name></middle_name>
	<last_name>Milovanović</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>igor.milovanovic@elfak.ni.ac.rs</email>
	<code>100319475328460012032</code>
	<orcid>100319475328460012032</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Faculty of Electronic Engineering, Nis, Serbia</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Ali Reza</first_name>
	<middle_name></middle_name>
	<last_name>Ashrafi</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>ashrafi@kashanu.ac.ir</email>
	<code>100319475328460012033</code>
	<orcid>100319475328460012033</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 87317-53153, I. R. Iran</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
