نتایج جستجو برای: excellent graphs
تعداد نتایج: 211819 فیلتر نتایج به سال:
The spectral density of various ensembles of sparse symmetric random matrices is analyzed using the cavity method. We consider two cases: matrices whose associated graphs are locally treelike, and sparse covariance matrices. We derive a closed set of equations from which the density of eigenvalues can be efficiently calculated. Within this approach, the Wigner semicircle law for Gaussian matric...
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
The flow and heat transfer of Jeffrey nanofluid over a stretching sheet with non-uniform source/sink is considered in the present analysis. Effects nonlinear thermal radiation second order slip are taken along uniform magnetic field. System partial differential equations governing described problem reduced to ordinary aid similarity transformations. Further, solved numerically using Runge-Kutta...
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
In human milk α-lactalbumin is one of the main proteins which harbors tumor-selective capabilities, named human α-lactalbumin made lethal to tumor cells (HAMLET). HAMLET is formed by binding of α-lactalbumin with oleic acid resulting in release of its Ca2+ ion and a folding change. It induces apoptosis in tumor cells but leaves normal differentiated cells unaffected. It has the capability to en...
In an emerging competitive market such as healthcare, managers should focus on achieving excellent ratings to distinguish their organization from others. When it comes to customer loyalty, "excellent" has a different meaning. Customers who are merely satisfied often do not come back. The purpose of this study was to find out what influences adult patients to rate their overall experience as "ex...
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید