Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

17 results for “vertices”
Set a search alert
Research ArticleOpen accessIn the keywordsA Kind of Intersection Graphs on Ideals of a RingA. A. TalebiProblem statement: Let R be a ring. The graph G(R) is the graph whose vertices are nontrivial ideal of R and in which two vertices u, v are joined by an edge, if and only if u ∩ v #{0}. Approach: In this study we study some properties of G(R). Results: We obtain conditions of R such that G(R) is … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 6 Feb 2012 · 7,258 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAn Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-RelationsSupat PatvichaichodProblem statement: The aim of this research is to investigate the Traveling Salesman Problems with Multi-Relations (TSPMR) in which each of the vertices has several edges and different weights. The study concerns the weights fluctuated by time in which the problem has more complexity than general TSP problem. However, this type of problem closes to the real-world situation in engineering … …Journal of Computer Science, Vol. 7, Issue 1 · 14 Jan 2011 · 6,924 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEvaluating the Performance of Equitable Dominating based Content Distribution Network DesignAmutharaj Joyson, Radhakrishnan ShanmugasundaramProblem statement: In this study, we considered an efficient and resilient large file content push problem in a large scale distributed content delivery networks and investigated the Quality of Service (QoS) requirements for content distribution. We investigated the effect of equitable dominating set in SON formation and how it was useful in reducing the redundancy? Approach: At first, we constructed … …Journal of Computer Science, Vol. 7, Issue 8 · 16 Jul 2011 · 6,654 accessesView PDFCite
Research ArticleOpen accessIn the abstractBased Approach to Improve the All-Pair Shortest Path ComputationLau Nguyen Dinh, Le Thanh TuanThis paper presents the development of a centralized algorithm for finding the shortest path between all pairs of vertices on a graph, utilizing the basic structure of the Floyd-Warshall sequential algorithm. The proposed algorithm leverages multiple processors to compute the shortest path between all vertex pairs, with one processor taking the central role in data management. This central processor divides … …Journal of Computer Science, Vol. 21, Issue 7 · 30 Jun 2025 · 2,903 accessesView PDFCite
Research ArticleOpen accessIn the abstractIrregular Reflexive Labeling and Elementary Row Operations for Enhanced Biometric Image EncryptionIka Hesti Agustin, Dafik et al.A total k-labeling defined the function fe: E(G) → {1, 2, …, ke} and fv: V(G) → {0, 2, …, 2kv}, where, k = max {ke, 2kv}. For graph G, the total k-labeling is called an edge (or a vertex) irregular reflexive k-labeling if the condition of every two different edges (or vertices) has different weights. The smallest value of … …Journal of Computer Science, Vol. 20, Issue 12 · 20 Nov 2024 · 4,149 accessesView PDFCite
Research ArticleOpen accessIn the abstractGraph Coloring Program of Exam Scheduling Modeling Based on Bitwise Coloring Algorithm Using PythonSamsul Arifin, Indra Bayu Muktyas, Wikky Fawwaz Al Maki, Mohd Khairul Bazli Mohd AzizA graph coloring is the process of assigning labels to the vertices of a graph in such a way that no two adjacent vertices have the same color. The chromatic number of a graph G is the smallest number of colors that can be assigned to it. Graph coloring has a wide range of applications and is commonly used to … …Journal of Computer Science, Vol. 18, Issue 1 · 1 Feb 2022 · 9,702 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Gröbner Bases and Their Uses in Solving System of Polynomial Equations and Graph ColoringHaridas Kumar Das, Nasim RezaThis paper is based on the analytic and computational solution procedures of Gröbner basis and its applications. We show the behavior of the ideals generated by polynomials from a polynomial ring. We also present the idea of a zero dimensional ideal and use of this ideal to solve system of polynomial equations. We then introduce an algorithmic procedure for solving … …Journal of Mathematics and Statistics, Vol. 14, Issue 1 · 27 Jun 2018 · 8,591 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Containment and Radical Graphs of a Commutative RingSaba Al-KaseasbehIn this study, we consider various graphs with the vertices being sets of ideals of a commutative ring with identity, R. How we define the edge set will vary according to distinct ideal theoretic properties. We apply a graphical approach to the study of ideal relationships in commutative rings and from this we obtain some properties of their graphs. …Journal of Mathematics and Statistics, Vol. 12, Issue 4 · 29 Dec 2016 · 7,266 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumber of Spanning Trees of Circulant Graphs C6n and their ApplicationsS. N. DaoudProblem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is Cn (a1,…..,ak). Approach: In this study the number τ(G) of spanning trees of the circulant graphs C6n with some non-fixed jumps such as C6n (1, n), C6n (1, n, 2n), C6n (1, n, 3n), … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 12 Dec 2011 · 7,626 accessesView PDFCite
Research ArticleOpen accessIn the abstractComplexity of Cocktail Party Graph and Crown GraphS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 12 Dec 2011 · 7,868 accessesView PDFCite