University of Kashan
Mathematics Interdisciplinary Research
2538-3639
2476-4965
5
1
2020
03
01
Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
1
12
EN
Harishchandra S.
Ramane
Department of Mathematics,
Karnatak University,
Dharwad, India
hsramane@yahoo.com
Saroja Y.
Talwar
Department of Mathematics,
Karnatak University,
Dharwad, India
saroyatalwar@gmail.com
Ivan
Gutman
Faculty of Science,
University of Kragujevac,
Kragujevac, Serbia
gutman@kg.ac.rs
10.22052/mir.2018.134814.1103
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
Zagreb indices,Zagreb coindices,total graph,semi-total point graph,semi-total line graph,subdivision graph
https://mir.kashanu.ac.ir/article_95588.html
https://mir.kashanu.ac.ir/article_95588_beb81a85be57455f29b1a0a7dec61bd4.pdf
University of Kashan
Mathematics Interdisciplinary Research
2538-3639
2476-4965
5
1
2020
03
01
Some Graph Polynomials of the Power Graph and its Supergraphs
13
22
EN
Asma
Hamzeh
0000-0001-7736-7626
Property and Casualty (Non-life) Insurance Research Group, Insurance Research Center, Tehran, Iran
hamze2006@yahoo.com
10.22052/mir.2019.173747.1121
In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
Dependence polynomial,independence polynomial,vertex cover polynomial,clique polynomial,power graph
https://mir.kashanu.ac.ir/article_96959.html
https://mir.kashanu.ac.ir/article_96959_b6e64d2437a2e69156ba43083ceabd35.pdf
University of Kashan
Mathematics Interdisciplinary Research
2538-3639
2476-4965
5
1
2020
03
01
A Mathematical Model for Evaluating the Efficiency of the University of Kashan’s Faculties
23
32
EN
Mostafa
Davtalab-Olyaie
Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
mostafaolyaie62@gmail.com
Saeed
Maleki
Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
mohammadsaeed21555@yahoo.com
10.22052/mir.2017.89450.1066
Efficiency evaluation of units has been of interest since many years in different domains such as management, economy, business, banking, and many others. Data envelopment analysis is one of the popular operations research methods for measuring the relative efficiency of units, which use multiple inputs to produce multiple outputs. As we know, universities play a key role in many aspects of a country such as industry, economic, training and many others. Therefore, evaluating the efficiency of the departments of a specific university is vital for effective allocation and utilization of educational resources, and consequently for enhancing its overall performance.<br />In this paper, we try to identify teaching and research strengths and weaknesses of each department of university of Kashan and to provide a powerful tool for a fair comparison. To do this, we first determine the effective input and output variables for each teaching and research components. We then present a DEA model to evaluate both relative teaching and research efficiencies of each department of university of Kashan.
Data Envelopment Analysis,Efficiency measurement,department's efficiency
https://mir.kashanu.ac.ir/article_49257.html
https://mir.kashanu.ac.ir/article_49257_4c1a0f73c44d0062e5a482a276514d80.pdf
University of Kashan
Mathematics Interdisciplinary Research
2538-3639
2476-4965
5
1
2020
03
01
Structure of the Fixed Point of Condensing Set-Valued Maps
33
41
EN
Zeinab
Soltani
Department of Pure Mathematics,
Faculty of Mathematical Sciences,
University of Kashan,
Kashan, 87317-53153, Iran
z.soltani@kashanu.ac.ir
10.22052/mir.2017.95130.1072
In this paper, we present structure of the fixed point set results for condensing set-valued map. Also, we prove a generalization of the Krasnosel'skii-Perov connectedness principle to the case of condensing set-valued maps.
fixed point,condensing map,degree theory
https://mir.kashanu.ac.ir/article_54828.html
https://mir.kashanu.ac.ir/article_54828_a3a52a4223907b65fdd6d42909995c7c.pdf
University of Kashan
Mathematics Interdisciplinary Research
2538-3639
2476-4965
5
1
2020
03
01
On the Estrada Index of Seidel Matrix
43
54
EN
Mardjan
Hakimi-Nezhaad
0000-0002-4638-6565
Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran
m.hakimi20@gmail.com
Modjtaba
Ghorbani
Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran
ghorbani30@gmail.com
10.22052/mir.2019.179267.1128
Let <em>G</em> be a simple graph with <em>n</em> vertices and with the Seidel matrix <em>S</em>. Suppose μ<sub>1</sub>, μ<sub>2</sub>,..., μ<sub>n</sub> are the Seidel eigenvalues of <em>G</em>. The Estrada index of the Seidel matrix of <em>G</em> is defined as SEE(G)=∑<sup>n</sup><sub>i=1</sub> e<sup>μ</sup><sub>i</sub>. In this paper, we compute the Estrada index of the Seidel matrix of some known graphs. Also, some bounds for the Seidel energy of graphs are given.
Seidel matrix,Seidel eigenvalue,Estrada index
https://mir.kashanu.ac.ir/article_107699.html
https://mir.kashanu.ac.ir/article_107699_6cdacbe1cea3da68282ce63081336193.pdf
University of Kashan
Mathematics Interdisciplinary Research
2538-3639
2476-4965
5
1
2020
03
01
Random Walk Modeling for Retrieving Information on Semantic Networking
55
70
EN
Meghdad
Abarghouei Nejad
0000-0001-5819-3106
Department of computational cognitive modeling, Institute of cognitive science study, Tehran, Iran
meghdad.abarghouei.nejad@gmail.com
Azizollah
Memariani
0000-0002-5087-2793
Department of financial mathematic,
kharazmi university, Tehran, Iran.
salmanabar@gmail.com
Javad
Hatami
University of Tehran,Institute for cognitive sciences studies
hatamijm@gmail.com
Masoud
Asadpour
Department of computational cognitive modeling,
Institute of cognitive science study,
Tehran, Iran.
asadpour@gmail.com
10.22052/mir.2020.210794.1186
In this article, the famous random walk model is exploited as a model of stochastic processes to retrieve some specific words which are used in social media by users. By spreading activation on semantic networking, this model can predict the probability of the words' activation, including all probabilities in different steps. In fact, the trend of probability in different steps is shown and the result of two different weights, when the steps tend to infinity is compared. In addition, it is shown that the results of the random walk model are aligned with the experimental psychological tests, showing that, as a model for semantic memory, it is a suitable model for retrieving in social media.
Semantic networking,Retrieval system,Random walk model,Spreading activation,Social Media
https://mir.kashanu.ac.ir/article_107700.html
https://mir.kashanu.ac.ir/article_107700_0dbfd67b46a87677d04d1457247bba15.pdf