35 results on '"Rao, Yongsheng"'
Search Results
2. A Novel Concept of Level Graph in Interval-Valued Fuzzy Graphs with Application.
- Author
-
Rao, Yongsheng, Lei, Siran, Talebi, Ali Asghar, and Mojahedfar, Masomeh
- Subjects
- *
FUZZY graphs , *LIFE sciences , *QUALITY of service , *HOSPITALS , *COMPUTER science , *INFORMATION storage & retrieval systems - Abstract
Many problems of practical interest can be modeled and solved by using interval-valued fuzzy graph (IVFG) algorithms. An IVFG is a very useful and effective tool for studying various calculations, fields of intelligence, and computer science, such as networking, imaging, and other fields, such as biological sciences. In different applications, they present an appropriate construction means. There were limitations in the definition of fuzzy graphs (FGs), which prompted us to propose a new definition for IVFGs. Some interesting properties related to the new IVFGs are investigated, and enough conditions under which the level graph on IVFGs is equivalent are obtained. Therefore, in this study, we present the properties of a level graph (LG) of an IVFG, and four operations, the Cartesian product (CP), composition (CO), union, and join, are investigated on it. Today, in a treatment system, one of the issues that can be very valuable and important to the quality of service to patients is finding qualified and efficient people in each department, which is not an easy task. But the interval-valued fuzzy graph, as an important fuzzy graph, can help us by considering the ability of each person in the form of intervals of numbers and the effectiveness of each one on the other (according to the relationships between them) in order to find the most worthy people. So, an application of IVFG to find the most effective person in a hospital information system has been introduced. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Explicit Properties of Apostol-Type Frobenius–Euler Polynomials Involving q -Trigonometric Functions with Applications in Computer Modeling.
- Author
-
Rao, Yongsheng, Khan, Waseem Ahmad, Araci, Serkan, and Ryoo, Cheon Seoung
- Subjects
- *
COMPUTER simulation , *APPLICATION software , *POLYNOMIALS , *BINOMIAL theorem , *EXPONENTIAL functions , *POWER series , *GENERATING functions - Abstract
In this article, we define q-cosine and q-sine Apostol-type Frobenius–Euler polynomials and derive interesting relations. We also obtain new properties by making use of power series expansions of q-trigonometric functions, properties of q-exponential functions, and q-analogues of the binomial theorem. By using the Mathematica program, the computational formulae and graphical representation for the aforementioned polynomials are obtained. By making use of a partial derivative operator, we derived some interesting finite combinatorial sums. Finally, we detail some special cases for these results. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. Some Properties of Double Domination in Vague Graphs with an Application.
- Author
-
Rao, Yongsheng, Cai, Ruiqi, Talebi, Ali Asghar, and Mojahedfar, Masomeh
- Subjects
- *
GRAPH theory , *DOMINATING set , *FUZZY graphs , *ENERGY consumption , *SYMMETRY - Abstract
This paper is devoted to the study of the double domination in vague graphs, and it is a contribution to the Special Issue "Advances in graph theory and Symmetry/Asymmetry" of Symmetry. Symmetry is one of the most important criteria that illustrate the structure and properties of fuzzy graphs. It has many applications in dominating sets and helps find a suitable place for construction. Vague graphs (VGs), which are a family of fuzzy graphs (FGs), are a well-organized and useful tool for capturing and resolving a range of real-world scenarios involving ambiguous data. In the graph theory, a dominating set (DS) for a graph G * = (X , E) is a subset D of the vertices X so that every vertex which is not in D is adjacent to at least one member of D. The subject of energy in graph theory is one of the most attractive topics serving a very important role in biological and chemical sciences. Hence, in this work, we express the notion of energy on a dominating vague graph (DVG) and also use the concept of energy in modeling problems related to DVGs. Moreover, we introduce a new notion of a double dominating vague graph (DDVG) and provide some examples to explain various concepts introduced. Finally, we present an application of energy on DVGs. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
5. On the Planarity of Graphs Associated with Symmetric and Pseudo Symmetric Numerical Semigroups.
- Author
-
Rao, Yongsheng, Binyamin, Muhammad Ahsan, Aslam, Adnan, Mehtab, Maria, and Fazal, Shazia
- Subjects
- *
MULTIPLICITY (Mathematics) , *CAYLEY graphs , *PLANAR graphs - Abstract
Let S (m , e) be a class of numerical semigroups with multiplicity m and embedding dimension e. We call a graph G S an S (m , e) -graph if there exists a numerical semigroup S ∈ S (m , e) with V (G S) = { x : x ∈ g (S) } and E (G S) = { x y ⇔ x + y ∈ S } , where g (S) denotes the gap set of S. The aim of this article is to discuss the planarity of S (m , e) -graphs for some cases where S is an irreducible numerical semigroup. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
6. On Convex Ordered Hyperrings.
- Author
-
Rao, Yongsheng, Gheisari, Mehdi, and Abbasizadeh, Nategh
- Subjects
- *
QUOTIENT rings - Abstract
The concept of convex ordered hyperrings associated with a strongly regular relation was investigated in this study. In this paper, we first studied hyperatom elements of ordered hyperrings and then investigated characterizations of quotient ordered rings. Is there a strongly regular relation θ on a convex ordered hyperring R for which R / θ is a convex ordered ring? This leads to an ordered ring obtained from an ordered hyperring. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Characterizations of Hyperideals and Interior Hyperideals in Ordered Γ-Semihypergroups.
- Author
-
Rao, Yongsheng, Zhou, Qixin, Cai, Ruiqi, and Khan, Aysha
- Subjects
- *
SEMIDEFINITE programming - Abstract
We give some conditions on ordered Γ -semihypergroups under which their interior hyperideal is equal to the hyperideal. In this paper, it is shown that in regular (resp., intraregular, semisimple) ordered Γ -semihypergroups, the hyperideals and the interior hyperideals coincide. To show the importance of these results, some examples and conclusions are provided. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. A Study on Special Kinds of Derivations in Ordered Hyperrings.
- Author
-
Rao, Yongsheng, Kosari, Saeed, Khan, Aysha, and Abbasizadeh, Nategh
- Subjects
- *
COMMUTATION (Electricity) , *HOMOMORPHISMS , *COMMUTATORS (Operator theory) - Abstract
In this study, we concentrate on an important class of ordered hyperstructures with symmetrical hyperoperations, which are called ordered Krasner hyperrings, and discuss strong derivations and homo-derivations. Additionally, we apply our results on nonzero proper hyperideals to the study of derivations of prime ordered hyperrings. This work is a pioneer in studies on structures such as hyperideals and homomorphisms of an ordered hyperring with the help of derivation notation. Finally, we prove some results on 2-torsion-free prime ordered hyperrings by using derivations. We show that if d is a derivation of 2-torsion-free prime hyperring R and the commutator set [ l , d (q) ] is equal to zero for all q in R, then l ∈ Z (R) . Moreover, we prove that if the commutator set (d (l) , q) is equal to zero for all l in R, then (d (R) , q) = 0 . [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Total 2-Rainbow Domination in Graphs.
- Author
-
Jiang, Huiqin and Rao, Yongsheng
- Subjects
- *
DOMINATING set , *BIPARTITE graphs , *PLANAR graphs , *UNDIRECTED graphs - Abstract
A total k-rainbow dominating function on a graph G = (V , E) is a function f : V (G) → 2 { 1 , 2 , ... , k } such that (i) ∪ u ∈ N (v) f (u) = { 1 , 2 , ... , k } for every vertex v with f (v) = ∅ , (ii) ∪ u ∈ N (v) f (u) ≠ ∅ for f (v) ≠ ∅ . The weight of a total 2-rainbow dominating function is denoted by ω (f) = ∑ v ∈ V (G) | f (v) | . The total k-rainbow domination number of G is the minimum weight of a total k-rainbow dominating function of G. The minimum total 2-rainbow domination problem (MT2RDP) is to find the total 2-rainbow domination number of the input graph. In this paper, we study the total 2-rainbow domination number of graphs. We prove that the MT2RDP is NP-complete for planar bipartite graphs, chordal bipartite graphs, undirected path graphs and split graphs. Then, a linear-time algorithm is proposed for computing the total k-rainbow domination number of trees. Finally, we study the difference in complexity between MT2RDP and the minimum 2-rainbow domination problem. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. Forcing Parameters in Fully Connected Cubic Networks.
- Author
-
Rao, Yongsheng, Kosari, Saeed, Anitha, Janakiraman, Rajasingh, Indra, and Rashmanlou, Hossein
- Subjects
- *
DOMINATING set , *ZERO (The number) - Abstract
Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem. Another variant is the zero forcing problem. Determining minimum cardinality of a power dominating set and zero forcing set in a graph are the power domination problem and zero forcing problem, respectively. Both problems are N P -complete. In this paper, we compute the power domination number and the zero forcing number for fully connected cubic networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. A Method for Expanding Predicates and Rules in Automated Geometry Reasoning System.
- Author
-
Rao, Yongsheng, Xie, Lanxing, Guan, Hao, Li, Jing, and Zhou, Qixin
- Subjects
- *
COLLEGE entrance examinations , *GEOMETRY , *KNOWLEDGE representation (Information theory) - Abstract
Predicates and rules are usually enclosed as built-in functions in automated geometry reasoning systems, meaning users cannot add any predicate or rule, thus resulting in a limited reasoning capability of the systems. A method for expanding predicates and rules in automated geometry reasoning systems is, thus, proposed. Specifically, predicate and rule descriptions are transformed to knowledge trees and forests based on formal representations of geometric knowledge, and executable codes are dynamically and automatically generated by using "code templates". Thus, a transformation from controlled natural language descriptions to mechanization algorithms is completed, and finally, the dynamic expansion of predicates and rules in the reasoning system is achieved. Moreover, the method has been implemented in an automated geometry reasoning system for Chinese college entrance examination questions, and the practicality and effectiveness of the method were tested. In conclusion, the enclosed setting, which is a shortcoming of traditional reasoning systems, is avoided, the user-defined dynamic expansion of predicates and rules is realized, the application scope of the reasoning system is extended, and the reasoning capability is improved. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
12. New Results in Vague Incidence Graphs with Application.
- Author
-
Rao, Yongsheng, Kosari, Saeed, and Gheisari, Mehdi
- Subjects
- *
UNIVERSITY & college employees , *NEUTRALITY - Abstract
Vague incidence graph (VIG), belonging to the FG family has good capabilities when facing with problems that cannot be expressed by FGs. When an element membership is not clear, neutrality is a good option that can be well-supported by a VIG. The previous definitions limitations in connectivity concept have led us to offer new definitions in VIGs. Hence, in this paper, the VIG and its matrix form are proposed. Vague incidence subgraph (VISG) is defined with several properties. Incidence pairs, paths, and connectivities between pairs in VIGs are introduced. Likewise, different types of strong and cut pair in VIGs are examined with their properties. Universities are one of the most important centers for human education and play an important role in the development of the country. But the point to be very careful is that the employees of a university must do their job in the best possible way. Therefore, we have tried to identify the most effective person in a university according to its performance by presenting an application. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. Some Properties of Weak Γ-Hyperfilters in OrderedΓ-Semihypergroups.
- Author
-
Rao, Yongsheng, Chen, Xiang, Kosari, Saeed, and Monemrad, Mohammadsadegh
- Subjects
- *
GENERALIZATION - Abstract
The main purpose of this paper is to study fundamental properties of weak Γ -hyperfilters on ordered Γ -semihypergroups that is a generalization of Γ -hyperfilters. Also, we investigate the relationship between weak Γ -hyperfilters and prime Γ -hyperideals in ordered Γ -semihypergroups. Finally, we introduce weak m , n - Γ -hyperfilters of ordered Γ -semihypergroups and conclude in paper with arising explicit theorems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Connectivity Index in Vague Graphs with Application in Construction.
- Author
-
Jiang, Huiqin and Rao, Yongsheng
- Subjects
- *
MOLECULAR connectivity index , *FUZZY graphs , *GRAPH connectivity - Abstract
The vague graph (VG), which has recently gained a place in the family of fuzzy graph (FG), has shown good capabilities in the face of problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Connectivity index (CI) in graphs is a fundamental issue in fuzzy graph theory that has wide applications in the real world. The previous definitions' limitations in the connectivity of fuzzy graphs directed us to offer new classifications in vague graph. Hence, in this paper, we investigate connectivity index, average connectivity index, and Randic index in vague graphs with several examples. Also, one of the motives of this research is to introduce some special types of vertices such as vague connectivity enhancing vertex, vague connectivity reducing vertex, and vague connectivity neutral vertex with their properties. Finally, an application of connectivity index in the selected town for building hospital is presented. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. A Study on A−I−Γ-Hyperideals and m,n−Γ-Hyperfilters in Ordered Γ-Semihypergroups.
- Author
-
Rao, Yongsheng, Kosari, Saeed, Shao, Zehui, Akhoundi, Maryam, and Omidi, Saber
- Subjects
- *
GENERALIZATION , *CONCEPTS - Abstract
The concept of almost interior Γ -hyperideals (A − I − Γ -hyperideals) in ordered Γ -semihypergroups is a generalization of the concept of interior Γ -hyperideals (I − Γ -hyperideals). In this study, the connections between I − Γ -hyperideals and A − I − Γ -hyperideals in ordered Γ -semihypergroups were presented. Also, we define the notion of m , n - Γ -hyperfilters of ordered Γ -semihypergroups and provide useful results on it. Moreover, we use the weak pseudoorders to construct quotient ordered Γ -semihypergroups by using ordered regular equivalence relations. These concepts lead us to a new research direction in ordered Γ -semihypergroups. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
16. Further generalizations of Hadamard and Fejér–Hadamard fractional inequalities and error estimates.
- Author
-
Rao, Yongsheng, Yussouf, Muhammad, Farid, Ghulam, Pečarić, Josip, and Tlili, Iskander
- Subjects
- *
INTEGRAL operators , *GENERALIZED integrals , *CONVEX functions , *GENERALIZATION , *MATHEMATICAL equivalence , *FRACTIONAL integrals - Abstract
The aim of this paper is to generalize the fractional Hadamard and Fejér–Hadamard inequalities. By using a generalized fractional integral operator containing extended Mittag-Leffler function via monotone function, for convex functions we generalize well known fractional Hadamard and Fejér–Hadamard inequalities. Also we study the error bounds of these generalized Hadamard and Fejér–Hadamard inequalities. We also obtain some published results from presented inequalities. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
17. A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable.
- Author
-
Zhu, Enqiang and Rao, Yongsheng
- Subjects
- *
PLANAR graphs , *LOGICAL prediction - Abstract
A total k -coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The total coloring conjecture (TCC) states that every simple graph G has a total Δ G + 2 -coloring, where Δ G is the maximum degree of G. This conjecture has been confirmed for planar graphs with maximum degree at least 7 or at most 5, i.e., the only open case of TCC is that of maximum degree 6. It is known that every planar graph G of Δ G ≥ 9 or Δ G ∈ 7,8 with some restrictions has a total Δ G + 1 -coloring. In particular, in (Shen and Wang, 2009), the authors proved that every planar graph with maximum degree 6 and without 4-cycles has a total 7-coloring. In this paper, we improve this result by showing that every diamond-free and house-free planar graph of maximum degree 6 is totally 7-colorable if every 6-vertex is not incident with two adjacent four cycles or three cycles of size p , q , ℓ for some p , q , ℓ ∈ 3,4,4 , 3,3,4 . [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
18. Study on fluid flow and heat transfer in fluid channel filled with KKL model-based nanofluid during natural convection using FVM.
- Author
-
Rao, Yongsheng, Shao, Zehui, Rahimi, Alireza, Kasaeipoor, Abbas, and Hasani Malekshah, Emad
- Subjects
- *
HEAT transfer fluids , *NATURAL heat convection , *FLUID friction , *NUSSELT number , *DYNAMIC viscosity , *RAYLEIGH number - Abstract
Purpose: A comprehensive study on the fluid flow and heat transfer in a nanofluid channel is carried out. The configuration of the channel is as like as quarter channel. The channel is filled with CuO–water nanofluid. Design/methodology/approach: The Koo–Kleinstreuer–Li model is used to estimate the dynamic viscosity and consider the Brownian motion. On the other hand, the influence of nanoparticles' shapes on the heat transfer rate is considered in the simulations. The channel is included with the injection pipes which are modeled as active bodies with constant temperature in the 2D simulations. Findings: The Rayleigh number, nanoparticle concentration and the thermal arrangements of internal pipes are the governing parameters. The hydrothermal aspects of natural convection are investigation using different approaches such as average Nusselt number, total entropy generation, Bejan number, streamlines, temperature fields, local heat transfer irreversibility, local fluid friction irreversibility and heatlines. Originality/value: The originality of this work is investigation of fluid flow, heat transfer, entropy generation and heatline visualization within a nanofluid-filled channel using a finite volume method. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
19. Shark Smell Optimizer applied to identify the optimal parameters of the proton exchange membrane fuel cell model.
- Author
-
Rao, Yongsheng, Shao, Zehui, Ahangarnejad, Arash Hosseinian, Gholamalizadeh, Ehsan, and Sobhani, Behnam
- Subjects
- *
PROTON exchange membrane fuel cells , *STATISTICS , *EXPERIMENTAL design , *METAHEURISTIC algorithms , *ELECTROCHEMICAL analysis - Abstract
Highlights: • A novel algorithm is applied to model the Proton Exchange Membrane Fuel Cell. • Different algorithms are referred to compare with Shark Smell Optimization results. • Respect to the results, proposed method is the best option among the other methods. • Two different practical cases are taken into account; for optimization. • Statistical analysis is done on the proposed method to attest to the reliability. Abstract Proton Exchange Membrane Fuel Cells regarded as promising devices for energy conversion systems. This study aims to introduce an exact modeling scheme for the proton exchange membrane fuel cell, which can imitate and model the electrical, electrochemical features of an actual Proton Exchange Membrane Fuel Cell stack. Most of the developed schemes are experimental, multi-variable, and comprise various non-linear terms which must be assessed precisely to assure a decent estimation. In this study, a novel optimization model is employed to determine the Proton Exchange Membrane fuel cell parameters accurately. The Shark Smell Optimizer simulates the hunting process for a Shark. Hence, Shark Smell Optimizer is a nature-inspired and metaheuristic optimization algorithm depends on the rules of metaheuristic proficiency, exploration and exploitation terms to evade errors in local optimums and to obtain appropriate responses. The introduced Shark Smell Optimizing method is examined on five commercial proton exchange membrane fuel cells stack concerning empirical data. Many types of research and operation examination are executed to verify the effectuality of the proposed scheme. Additionally, for more authentication, Proton Exchange Membrane Fuel Cells modeling with Shark Smell Optimizer obtained data is compared with other optimization algorithm results. A statistical analysis also carried out for proposed method, the obtained show the reliability of Shark Smell Optimizer in comparison to other utilized techniques. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. An Investigation on Weak Concepts in Ordered Hyperstructures.
- Author
-
Rao, Yongsheng, Zhao, Jietong, Khan, Aysha, Akhoundi, Maryam, and Omidi, Saber
- Subjects
- *
GENERALIZATION - Abstract
The class of weak pseudoorders and left weak interior hyperideals in ordered hyperstructures is a generalization of pseudoorders and interior hyperideals. In this work, we study the concept of weak pseudoorders and left weak interior hyperideals in ordered hyperstructures and explore some results concerning the new defined concepts for ordered hyperrings and ordered Γ-semihypergroups. In this regards, we intend to concentrate our efforts on the relationship between the left weak interior hyperideal and interior hyperideal of an ordered hyperstructure. A characterization of a regular ordered hyperstructure via a left weak interior hyperideal is given. Finally, we characterize the notion of left weak interior simple ordered hyperstructures in terms of left weak interior hyperideals. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
21. A Survey on Domination in Vague Graphs with Application in Transferring Cancer Patients between Countries.
- Author
-
Rao, Yongsheng, Chen, Ruxian, Wu, Pu, Jiang, Huiqin, and Kosari, Saeed
- Subjects
- *
FUZZY graphs , *DOMINATING set , *ARTIFICIAL intelligence , *DECISION theory , *INDEPENDENT sets , *CANCER patients , *HEALTH facilities , *PUBLIC hospitals - Abstract
Many problems of practical interest can be modeled and solved by using fuzzy graph (FG) algorithms. In general, fuzzy graph theory has a wide range of application in various fields. Since indeterminate information is an essential real-life problem and is often uncertain, modeling these problems based on FG is highly demanding for an expert. A vague graph (VG) can manage the uncertainty relevant to the inconsistent and indeterminate information of all real-world problems in which fuzzy graphs may not succeed in bringing about satisfactory results. Domination in FGs theory is one of the most widely used concepts in various sciences, including psychology, computer sciences, nervous systems, artificial intelligence, decision-making theory, etc. Many research studies today are trying to find other applications for domination in their field of interest. Hence, in this paper, we introduce different kinds of domination sets, such as the edge dominating set (EDS), the total edge dominating set (TEDS), the global dominating set (GDS), and the restrained dominating set (RDS), in product vague graphs (PVGs) and try to represent the properties of each by giving some examples. The relation between independent edge sets (IESs) and edge covering sets (ECSs) are established. Moreover, we derive the necessary and sufficient conditions for an edge dominating set to be minimal and show when a dominance set can be a global dominance set. Finally, we try to explain the relationship between a restrained dominating set and a restrained independent set with an example. Today, we see that there are still diseases that can only be treated in certain countries because they require a long treatment period with special medical devices. One of these diseases is leukemia, which severely affects the immune system and the body's defenses, making it impossible for the patient to continue living a normal life. Therefore, in this paper, using a dominating set, we try to categorize countries that are in a more favorable position in terms of medical facilities, so that we can transfer the patients to a suitable hospital in the countries better suited in terms of both cost and distance. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
22. A Study on Domination in Vague Incidence Graph and Its Application in Medical Sciences.
- Author
-
Rao, Yongsheng, Kosari, Saeed, Shao, Zehui, Cai, Ruiqi, and Xinyue, Liu
- Subjects
- *
AD hoc computer networks , *DOMINATING set , *MEDICAL sciences , *FUZZY graphs , *ELECTRIC power distribution grids , *SCIENTIFIC computing - Abstract
Fuzzy graphs (FGs), broadly known as fuzzy incidence graphs (FIGs), have been acknowledged as being an applicable and well-organized tool to epitomize and solve many multifarious real-world problems in which vague data and information are essential. Owing to unpredictable and unspecified information being an integral component in real-life problems that are often uncertain, it is highly challenging for an expert to illustrate those problems through a fuzzy graph. Therefore, resolving the uncertainty accompanying the unpredictable and unspecified information of any real-world problem can be done by applying a vague incidence graph (VIG), based on which the FGs may not engender satisfactory results. Similarly, VIGs are outstandingly practical tools for analyzing different computer science domains such as networking, clustering, and also other issues such as medical sciences, and traffic planning. Dominating sets (DSs) enjoy practical interest in several areas. In wireless networking, DSs are being used to find efficient routes with ad-hoc mobile networks. They have also been employed in document summarization, and in secure systems designs for electrical grids; consequently, in this paper, we extend the concept of the FIG to the VIG, and show some of its important properties. In particular, we discuss the well-known problems of vague incidence dominating set, valid degree, isolated vertex, vague incidence irredundant set and their cardinalities related to the dominating, etc. Finally, a DS application for VIG to properly manage the COVID-19 testing facility is introduced. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
23. A New Block Structural Index Reduction Approach for Large-Scale Differential Algebraic Equations.
- Author
-
Tang, Juan and Rao, Yongsheng
- Subjects
- *
ALGEBRAIC equations , *DIFFERENTIAL equations , *ALGORITHMS , *UNIVERSAL language - Abstract
A new generation of universal tools and languages for modeling and simulation multi-physical domain applications has emerged and became widely accepted; they generate large-scale systems of differential algebraic equations (DAEs) automatically. Motivated by the characteristics of DAE systems with large dimensions, high index or block structures, we first propose a modified Pantelides' algorithm (MPA) for any high order DAEs based on the Σ matrix, which is similar to Pryce's Σ method. By introducing a vital parameter vector, a modified Pantelides' algorithm with parameters has been presented. It leads to a block Pantelides' algorithm (BPA) naturally which can immediately compute the crucial canonical offsets for whole (coupled) systems with block-triangular form. We illustrate these algorithms by some examples, and preliminary numerical experiments show that the time complexity of BPA can be reduced by at least O (ℓ) compared to the MPA, which is mainly consistent with the results of our analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
24. Vague Graph Structure with Application in Medical Diagnosis.
- Author
-
Kosari, Saeed, Rao, Yongsheng, Jiang, Huiqin, Liu, Xinyue, Wu, Pu, and Shao, Zehui
- Subjects
- *
DIAGNOSIS , *FUZZY graphs , *MEDICAL decision making , *DEFINITIONS , *COMPUTER science , *MEDICAL sciences - Abstract
Fuzzy graph models enjoy the ubiquity of being in natural and human-made structures, namely dynamic process in physical, biological and social systems. As a result of inconsistent and indeterminate information inherent in real-life problems which are often uncertain, it is highly difficult for an expert to model those problems based on a fuzzy graph (FG). Vague graph structure (VGS) can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. Likewise, VGSs are very useful tools for the study of different domains of computer science such as networking, capturing the image, clustering, and also other issues like bioscience, medical science, and traffic plan. The limitations of past definitions in fuzzy graphs have led us to present new definitions in VGSs. Operations are conveniently used in many combinatorial applications. In various situations, they present a suitable construction means; therefore, in this research, three new operations on VGSs, namely, maximal product, rejection, residue product were presented, and some results concerning their degrees and total degrees were introduced. Irregularity definitions have been of high significance in the network heterogeneity study, which have implications in networks found across biology, ecology and economy; so special concepts of irregular VGSs with several key properties were explained. Today one of the most important applications of decision making is in medical science for diagnosing the patient's disease. Hence, we recommend an application of VGS in medical diagnosis. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
25. Certain Properties of Vague Graphs with a Novel Application.
- Author
-
Rao, Yongsheng, Kosari, Saeed, and Shao, Zehui
- Subjects
- *
LAPLACIAN matrices , *FUZZY graphs , *DEFINITIONS , *DOMINATING set , *SOCIAL systems - Abstract
Fuzzy graph models enjoy the ubiquity of being present in nature and man-made structures, such as the dynamic processes in physical, biological, and social systems. As a result of inconsistent and indeterminate information inherent in real-life problems that are often uncertain, for an expert, it is highly difficult to demonstrate those problems through a fuzzy graph. Resolving the uncertainty associated with the inconsistent and indeterminate information of any real-world problem can be done using a vague graph (VG), with which the fuzzy graphs may not generate satisfactory results. The limitations of past definitions in fuzzy graphs have led us to present new definitions in VGs. The objective of this paper is to present certain types of vague graphs (VGs), including strongly irregular (SI), strongly totally irregular (STI), neighborly edge irregular (NEI), and neighborly edge totally irregular vague graphs (NETIVGs), which are introduced for the first time here. Some remarkable properties associated with these new VGs were investigated, and necessary and sufficient conditions under which strongly irregular vague graphs (SIVGs) and highly irregular vague graphs (HIVGs) are equivalent were obtained. The relation among strongly, highly, and neighborly irregular vague graphs was established. A comparative study between NEI and NETIVGs was performed. Different examples are provided to evaluate the validity of the new definitions. A new definition of energy called the Laplacian energy (LE) is presented, and its calculation is shown with some examples. Likewise, we introduce the notions of the adjacency matrix (AM), degree matrix (DM), and Laplacian matrix (LM) of VGs. The lower and upper bounds for the Laplacian energy of a VG are derived. Furthermore, this study discusses the VG energy concept by providing a real-time example. Finally, an application of the proposed concepts is presented to find the most effective person in a hospital. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
26. A Machine Proof System of Point Geometry Based on Coq.
- Author
-
Lei, Siran, Guan, Hao, Jiang, Jianguo, Zou, Yu, and Rao, Yongsheng
- Subjects
- *
GEOMETRY , *MATHEMATICS education , *TRUST , *COMPUTER science , *LIBRARY cooperation - Abstract
An important development in geometric algebra in recent years is the new system known as point geometry, which treats points as direct objects of operations and considerably simplifies the process of geometric reasoning. In this paper, we provide a complete formal description of the point geometry theory architecture and give a rigorous and reliable formal verification of the point geometry theory based on the theorem prover Coq. Simultaneously, a series of tactics are also designed to assist in the proof of geometric propositions. Based on the theoretical architecture and proof tactics, a universal and scalable interactive point geometry machine proof system, PointGeo, is built. In this system, any arbitrary point-geometry-solvable geometric statement may be proven, along with readable information about the solution's procedure. Additionally, users may augment the rule base by adding trustworthy rules as needed for certain issues. The implementation of the system expands the library of Coq resources on geometric algebra, which will become a significant research foundation for the fields of geometric algebra, computer science, mathematics education, and other related fields. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
27. On the Classification of Telescopic Numerical Semigroups of Some Fixed Multiplicity.
- Author
-
Wang, Ying, Binyamin, Muhammad Ahsan, Amin, Iqra, Aslam, Adnan, and Rao, Yongsheng
- Subjects
- *
MULTIPLICITY (Mathematics) , *CLASSIFICATION , *ALGEBRAIC codes - Abstract
The telescopic numerical semigroups are a subclass of symmetric numerical semigroups widely used in algebraic geometric codes. Suer and Ilhan gave the classification of triply generated telescopic numerical semigroups up to multiplicity 10 and by using this classification they computed some important invariants in terms of the minimal system of generators. In this article, we extend the results of Suer and Ilhan for telescopic numerical semigroups of multiplicities 8 and 12 with embedding dimension four. Furthermore, we compute two important invariants namely the Frobenius number and genus for these classes in terms of the minimal system of generators. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. Graphs Associated with the Ideals of a Numerical Semigroup Having Metric Dimension 2.
- Author
-
Wang, Ying, Binyamin, Muhammad Ahsan, Ali, Wajid, Aslam, Adnan, and Rao, Yongsheng
- Subjects
- *
METRIC geometry - Abstract
Let Λ be a numerical semigroup and I ⊂ Λ be an irreducible ideal of Λ. The graph G I Λ assigned to an ideal I of Λ is a graph with elements of Λ ∖ I ∗ as vertices, and any two vertices x and y are adjacent if and only if x + y ∈ I. In this work, we give a complete characterization (up to isomorphism) of the graph G I Λ having metric dimension 2. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
29. Construction of Fair Dice Pairs.
- Author
-
Huang, Yong, Zeng, Zhenbing, Rao, Yongsheng, Zou, Yu, Wang, Ying, and Huang, Xing
- Subjects
- *
FOURIER transforms , *CONSTRUCTION , *MATHEMATICAL equivalence , *NONCOOPERATIVE games (Mathematics) - Abstract
An interesting and challenging problem in mathematics is how to construct fair dice pairs. In this paper, by means of decomposing polynomials in a residue class ring and applying the Discrete Fourier Transformation, we present all the 2000 fair dice pairs and their 8 equivalence classes in a four-person game, identifying what we call the mandarin duck property of fair dice pairs. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
30. On Upper Total Domination Versus Upper Domination in Graphs.
- Author
-
Zhu, Enqiang, Liu, Chanjuan, Deng, Fei, and Rao, Yongsheng
- Subjects
- *
DOMINATING set , *GRAPH connectivity , *GEODESICS , *GEOMETRIC vertices , *REGULAR graphs - Abstract
A total dominating set of a graph G is a dominating set S of G such that the subgraph induced by S contains no isolated vertex, where a dominating set of G is a set of vertices of G such that each vertex in V (G) \ S has a neighbor in S. A (total) dominating set S is said to be minimal if S \ { v } is not a (total) dominating set for every v ∈ S . The upper total domination number Γ t (G) and the upper domination number Γ (G) are the maximum cardinalities of a minimal total dominating set and a minimal dominating set of G, respectively. For every graph G without isolated vertices, it is known that Γ t (G) ≤ 2 Γ (G) . The case in which Γ t (G) Γ (G) = 2 has been studied in Cyman et al. (Graphs Comb 34:261–276, 2018), which focused on the characterization of the connected cubic graphs and proposed one problem to be solved and two questions to be answered in terms of the value of Γ t (G) Γ (G) . In this paper, we solve this problem, i.e., the characterization of the subcubic graphs G that satisfy Γ t (G) Γ (G) = 2 , by constructing a class of subcubic graphs, which we call triangle-trees. Moreover, we show that the answers to the two questions are negative by constructing connected cubic graphs G that satisfy Γ t (G) Γ (G) > 3 2 and a class of regular non-complete graphs G that satisfy Γ t (G) Γ (G) = 2 . [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
31. Increasing of fuel cell economic benefits by optimal participation strategy with energy storages and other distributed resources and considering uncertainties and various markets.
- Author
-
Shao, Zehui, Ahangarnejad, Arash Hosseinian, Monazzah, Ali, Rao, Yongsheng, and Rodriguez, Dragan
- Subjects
- *
FUEL cells , *ENERGY storage , *WIND turbines , *MICROGRIDS , *STOCHASTIC programming - Abstract
Abstract The Participation of Distributed Energy Resources (DERs) such as Fuel Cell (FC) in Daily Market is one of the main Problems of these resources. Uncertain nature of market price and power system parameters can be affected to economic performance of DERs and is caused deviation penalties during market settlements. This article introduces an optimal combined sharing strategy of fuel cell/wind turbine/battery storage unit and demand response as microgrid to improve all of them profit in market participation. In order to adjust of contracted power and reduce the imbalanced energy, the Adjusted Market (AM) is considered 3–7 h before the delivered time, which the offered power could be updated in this time. Uncertainty of markets and DERs generations is considered using an optimal stochastic optimization approach. The probabilistic scenarios are generated using forecast error database in daily, adjusted and imbalance market as production of DERs. Uncertain variables are predicted by a neuro-fuzzy model. Finally, to demonstrate of the proposed joint model strategy, a test system contain fuel cell/wind turbine/battery storage unit and demand response is considered and the results is calculated during one week, month, and year period in joint and separated conditions. Highlights • Improving of fuel cell profit for wide expanding of related energy in the world. • Demand response considering to prevent damage of producers and load in microgrid. • Economical analysis of each considered factors such as adjusted market. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
32. A systematic study of critical miRNAs on cells proliferation and apoptosis by the shortest path.
- Author
-
Xu, Peng, Wu, Qian, Lu, Deyang, Yu, Jian, Rao, Yongsheng, Kou, Zheng, Fang, Gang, Liu, Wenbin, and Han, Henry
- Subjects
- *
APOPTOSIS , *MICRORNA , *CELL proliferation , *NON-coding RNA , *LIVER cancer - Abstract
Background: MicroRNAs are a class of important small noncoding RNAs, which have been reported to be involved in the processes of tumorigenesis and development by targeting a few genes. Existing studies show that the imbalance between cell proliferation and apoptosis is closely related to the initiation and development of cancers. However, the impact of miRNAs on this imbalance has not been studied systematically. Results: In this study, we first construct a cell fate miRNA-gene regulatory network. Then, we propose a systematical method for calculating the global impact of miRNAs on cell fate genes based on the shortest path. Results on breast cancer and liver cancer datasets show that most of the cell fate genes are perturbed by the differentially expressed miRNAs. Most of the top-identified miRNAs are verified in the Human MicroRNA Disease Database (HMDD) and are related to breast and liver cancers. Function analysis shows that the top 20 miRNAs regulate multiple cell fate related function modules and interact tightly based on their functional similarity. Furthermore, more than half of them can promote sensitivity or induce resistance to some anti-cancer drugs. Besides, survival analysis demonstrates that the top-ranked miRNAs are significantly related to the overall survival time in the breast and liver cancers group. Conclusion: In sum, this study can help to systematically study the important role of miRNAs on proliferation and apoptosis and thereby uncover the key miRNAs during the process of tumorigenesis. Furthermore, the results of this study will contribute to the development of clinical therapy based miRNAs for cancers. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
33. Some Bicyclic Graphs Having 2 as Their Laplacian Eigenvalues.
- Author
-
Farkhondeh, Masoumeh, Habibi, Mohammad, Mojdeh, Doost Ali, and Rao, Yongsheng
- Subjects
- *
EIGENVALUES - Abstract
If G is a graph, its Laplacian is the difference between the diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs G 1 and G 2 is a graph G = G 1 ⊙ u v G 2 with V (G) = V (G 1) ∪ V (G 2) and E (G) = E (G 1) ∪ E (G 2) ∪ { e = u v } where u ∈ V (G 1) and v ∈ V (G 2) . In this paper, we study some structural conditions ensuring the presence of 2 in the Laplacian spectrum of bicyclic graphs of type G 1 ⊙ u v G 2 . We also provide a condition under which a bicyclic graph with a perfect matching has a Laplacian eigenvalue 2. Moreover, we characterize the broken sun graphs and the one-edge connection of two broken sun graphs by their Laplacian eigenvalue 2. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
34. Characterization of Graphs Associated with Numerical Semigroups.
- Author
-
Binyamin, Muhammad Ahsan, Siddiqui, Hafiz Muhammad Afzal, Khan, Nida Munawar, Aslam, Adnan, and Rao, Yongsheng
- Subjects
- *
UNDIRECTED graphs , *MATHEMATICAL connectedness , *DIAMETER , *COMPLETE graphs , *CAYLEY graphs - Abstract
Let Γ be a numerical semigroup. We associate an undirected graph G (Γ) with a numerical semigroup Γ with vertex set { v i : i ∈ N \ Γ } and edge set { v i v j ⇔ i + j ∈ Γ } . In this article, we discuss the connectedness, diameter, girth, and some other related properties of the graph G (Γ) . [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
35. The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2).
- Author
-
Jiang, Huiqin, Wu, Pu, Shao, Zehui, Rao, Yongsheng, and Liu, Jia-Bao
- Subjects
- *
PETERSEN graphs , *DOMINATING set , *INTEGERS , *EDGES (Geometry) , *POINT mappings (Mathematics) - Abstract
A double Roman dominating function (DRDF) f on a given graph G is a mapping from V (G) to { 0 , 1 , 2 , 3 } in such a way that a vertex u for which f (u) = 0 has at least a neighbor labeled 3 or two neighbors both labeled 2 and a vertex u for which f (u) = 1 has at least a neighbor labeled 2 or 3. The weight of a DRDF f is the value w (f) = ∑ u ∈ V (G) f (u) . The minimum weight of a DRDF on a graph G is called the double Roman domination number γ d R (G) of G. In this paper, we determine the exact value of the double Roman domination number of the generalized Petersen graphs P (n , 2) by using a discharging approach. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.