@article {
author = {Ramane, Harishchandra S. and Talwar, Saroja Y. and Gutman, Ivan},
title = {Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs},
journal = {Mathematics Interdisciplinary Research},
volume = {5},
number = {1},
pages = {1-12},
year = {2020},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2018.134814.1103},
abstract = {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.},
keywords = {Zagreb indices,Zagreb coindices,total graph,semi-total point graph,semi-total line graph,subdivision graph},
url = {http://mir.kashanu.ac.ir/article_95588.html},
eprint = {http://mir.kashanu.ac.ir/article_95588_beb81a85be57455f29b1a0a7dec61bd4.pdf}
}
@article {
author = {Hamzeh, Asma},
title = {Some Graph Polynomials of the Power Graph and its Supergraphs},
journal = {Mathematics Interdisciplinary Research},
volume = {5},
number = {1},
pages = {13-22},
year = {2020},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2019.173747.1121},
abstract = {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.},
keywords = {Dependence polynomial,independence polynomial,vertex cover polynomial,clique polynomial,power graph},
url = {http://mir.kashanu.ac.ir/article_96959.html},
eprint = {http://mir.kashanu.ac.ir/article_96959_b6e64d2437a2e69156ba43083ceabd35.pdf}
}
@article {
author = {Davtalab-Olyaie, Mostafa and Maleki, Saeed},
title = {A Mathematical Model for Evaluating the Efficiency of the University of Kashan’s Faculties},
journal = {Mathematics Interdisciplinary Research},
volume = {5},
number = {1},
pages = {23-32},
year = {2020},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2017.89450.1066},
abstract = {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. 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.},
keywords = {Data Envelopment Analysis,Efficiency measurement,department's efficiency},
url = {http://mir.kashanu.ac.ir/article_49257.html},
eprint = {http://mir.kashanu.ac.ir/article_49257_4c1a0f73c44d0062e5a482a276514d80.pdf}
}
@article {
author = {Soltani, Zeinab},
title = {Structure of the Fixed Point of Condensing Set-Valued Maps},
journal = {Mathematics Interdisciplinary Research},
volume = {5},
number = {1},
pages = {33-41},
year = {2020},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2017.95130.1072},
abstract = {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.},
keywords = {fixed point,condensing map,degree theory},
url = {http://mir.kashanu.ac.ir/article_54828.html},
eprint = {http://mir.kashanu.ac.ir/article_54828_a3a52a4223907b65fdd6d42909995c7c.pdf}
}
@article {
author = {Hakimi-Nezhaad, Mardjan and Ghorbani, Modjtaba},
title = {On the Estrada index of Seidel Matrix},
journal = {Mathematics Interdisciplinary Research},
volume = {5},
number = {1},
pages = {43-54},
year = {2020},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2019.179267.1128},
abstract = {Let G be a simple graph with n vertices and with the Seidel matrix S. Suppose μ1, μ2,..., μn are the Seidel eigenvalues of G. The Estrada index of the Seidel matrix of G is defined as SEE(G)=\sum_{i=1}^{n} eμi. 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.},
keywords = {Seidel matrix,Seidel eigenvalue,Estrada index},
url = {http://mir.kashanu.ac.ir/article_107699.html},
eprint = {http://mir.kashanu.ac.ir/article_107699_6cdacbe1cea3da68282ce63081336193.pdf}
}
@article {
author = {Abarghouei Nejad, Meghdad and Memariani, Azizollah and Hatami, Javad and Asadpour, Masoud},
title = {Random walk modeling for retrieving information on semantic networking},
journal = {Mathematics Interdisciplinary Research},
volume = {5},
number = {1},
pages = {55-70},
year = {2020},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2020.210794.1186},
abstract = {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.},
keywords = {Semantic networking,Retrieval system,Random walk model,Spreading activation,Social Media},
url = {http://mir.kashanu.ac.ir/article_107700.html},
eprint = {http://mir.kashanu.ac.ir/article_107700_0dbfd67b46a87677d04d1457247bba15.pdf}
}