Showing Results for
- Academic Journals (481)
Search Results
- 481
Academic Journals
- 481
-
From:Journal of Advanced Mathematical Studies (Vol. 7, Issue 1) Peer-ReviewedIn 2008 Jachymski used the context of metric spaces endowed with a graph in theory of fixed points in some general structures and In 2012, Samet introduced a new concept of [alpha]-[psi]-contractive type mappings and...
-
From:Mathematics of Operations Research (Vol. 25, Issue 2) Peer-ReviewedA study of a new method for examining correlated stochastic systems is discussed. Majorization of weighted trees is presented and characterized and shown to be a useful tool in this context. Stochastic models with...
-
From:Annals of Operations Research (Vol. 196, Issue 1) Peer-ReviewedGiven an undirected graph G = (V, E) with vertex set V = {1, ..., n} and edge set E [subset or equal to] V x V. Let w : V [right arrow] [Z.sup.+] be a weighting function that assigns to each vertex i [member of] V a...
-
From:International Journal of CombinatoricsPeer-ReviewedA subset D of the vertex set of a graph G, is a dominating set if every vertex in V - D is adjacent to at least one vertex in D. The domination number [gamma](G) is the minimum cardinality of a dominating set of G. A...
-
From:International Journal of High Performance Computing Applications (Vol. 19, Issue 1) Peer-ReviewedAbstract In this paper, we present CGMgraph, the first integrated library of parallel graph methods for PC clusters based on Coarse Grained Multicomputer (CGM) algorithms. CGMgraph implements parallel methods for...
-
From:Scientia Magna (Vol. 6, Issue 1) Peer-ReviewedIn a given graph G = (V,E), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G if there exists a unique extension of the colors of S to a c [greater than or...
-
From:Annals of Operations Research (Vol. 298, Issue 1-2) Peer-ReviewedThe transportation problem is a fundamental problem in operations research, where items need to be transported from supply nodes (each with a given supply) to demand nodes (each with a given demand) in the cheapest...
-
From:BioData Mining (Vol. 3) Peer-ReviewedThe quantities of data obtained by the new high-throughput technologies, such as microarrays or ChIP-Chip arrays, and the large-scale OMICS-approaches, such as genomics, proteomics and transcriptomics, are becoming...
-
From:PLoS ONE (Vol. 11, Issue 12) Peer-ReviewedPurpose To present en face optical coherence tomography (OCT) images generated by graph-search theory algorithm-based custom software and examine correlation with other imaging modalities. Methods En face OCT...
-
From:Mathematical Problems in Engineering (Vol. 2020) Peer-ReviewedA graph is said to be a regular graph if all its vertices have the same degree; otherwise, it is irregular. In general, irregularity indices are used for computational analysis of nonregular graph topological...
-
From:Journal of Advanced Mathematical Studies (Vol. 5, Issue 1) Peer-ReviewedIn this paper, we study the size of the largest clique, namely the clique number, in a random graph model G(n, [tau])on n vertices, which has degree distribution with regularly varying tail with scaling exponent...
-
From:Nature Biotechnology (Vol. 29, Issue 11) Peer-ReviewedThe development of algorithmic ideas for next-generation sequencing can be traced back 300 years to the Prussian city of Konigsberg (present-day Kaliningrad, Russia), where seven bridges joined the four parts of the...
-
From:Operations Research (Vol. 57, Issue 2) Peer-ReviewedWe present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from...
-
From:IETE Journal of Research (Vol. 59, Issue 5) Peer-ReviewedByline: Selvakumar. Raja, Mala. John Tamil is a South Indian language spoken widely in Tamil Nadu, one of the states of India. It is one of the oldest languages in the world, and the Tamil script is used to write the...
-
From:International Journal of Mathematics and Mathematical Sciences (Vol. 2017) Peer-ReviewedLet G be a graph and [phi] : V(G) [union] E(G) [right arrow] {1, 2, 3, ..., k} be a k-total coloring. Let w(v) denote the sum of color on a vertex v and colors assigned to edges incident to v. If w(u) =[not equal to]...
-
From:Journal of Applied and Engineering Mathematics (Vol. 7, Issue 2) Peer-ReviewedE. R. van Dam and W. H. Haemers [15] conjectured that almost all graphs are determined by their spectra. Nevertheless, the set of graphs which are known to be determined by their spectra is small. Hence, discovering...
-
From:Journal of Applied and Engineering Mathematics (Vol. 8, Issue 1A) Peer-ReviewedThe reverse vertex degree of a vertex v of a simple connected graph G defined as; [c.sub.v] = [DELTA] - [d.sub.v] + 1 where [DELTA] denotes the largest of all degrees of vertices of G and [d.sub.v] denotes the number of...
-
From:Japan Academy Proceedings Series A: Mathematical Sciences (Vol. 95, Issue 1) Peer-ReviewedIn this paper, we give a formula for the number of orientable small covers over a product of simplices up to D-J equivalence. We also give an approximate value for the ratio between the number of small covers and the...
-
From:Informatica (Vol. 39, Issue 3) Peer-ReviewedConquerors of old (like, e.g., Alexander the Great or Ceasar) had to solve the following deployment problem. Sufficiently strong units had to be stationed at locations of strategic importance, and the moving forces had...
-
From:International Journal of CombinatoricsPeer-ReviewedA linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k. The linear k-arboricity of G, denoted by [la.sub.k](G), is the minimum number of linear k-forests needed...