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

22 results for “Complete graph”
Set a search alert
Research ArticleOpen accessEvery word in the titleSome Applications of Spanning Trees in Complete and Complete Bipartite GraphsS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) is an important invariant, it is also an important measure of reliability of a network. Approach: Using linear algebra and matrix analysis techniques to evaluate the associated determinants. Results: In this study we derive simple formulas for the number of spanning trees of complete graph Kn and complete bipartite … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 15 Feb 2012 · 7,263 accessesView PDFCite
Research ArticleOpen accessIn the keywordsGraph Folding of Some Special GraphsE. El-Kholy, A. El-EsawyIn this study we introduced the definition of graph folding then, we proved that we cannot fold any complete graph except the bipartite graph. By using incidence matrices we described the graph folding. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 30 Mar 2010 · 7,351 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn 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 keywordsExperimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing ProblemZoheir EzzianeThis research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,716 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 abstractFals-Ism: A Graph Isomorphism Framework for Multi-Level Detection of Falsified PDF DocumentsJosue Nguinabe, Franklin Tchakounte et al.Fake Portable Document Format (PDF) documents are disseminated in an incredible rhythm across social media. Negative incidences are obvious but effective solutions identifying falsified items in the PDF are still in need. Unlike determining malicious scripts inserted into the file, this research aims at identifying falsified objects from different layers of the document. Specifically, we introduce Fals-Ism, a novel approach … …Journal of Computer Science, Vol. 19, Issue 5 · 11 May 2023 · 5,527 accessesView PDFCite
Research ArticleOpen accessIn the abstractQuickest Multi-Commodity Flow Over Time with Partial Lane ReversalsTanka Nath Dhamala, Shiva Prakash Gupta, Durga Prasad Khanal, Urmila PyakurelRouting of more than one different commodity from specific origin nodes to the corresponding destination nodes through the arcs of an underlying network respecting the capacity constraints is one of the main problems in operational research. Among them, the quickest multi-commodity flow problem concerns with minimization of time taken to complete this process. The general multi-commodity and quickest multi-commodity flow … …Journal of Mathematics and Statistics, Vol. 16, Issue 1 · 2 Oct 2020 · 7,307 accessesView PDFCite
Research ArticleOpen accessIn the abstractCONSTRUCTION OF GENERAL SUBSUMPTIVE SOLUTIONS OF BOOLEAN EQUATIONS VIA COMPLETE-SUM DERIVATIONAli Muhammad Ali Rushdi, Hussain Mobarak AlbarakatiBoolean-equation solving permeates many diverse areas of modern science. To solve a system of Boolean equations, one usually combines them into an equivalent single Boolean equation {f(X) = 0} whose set of solutions is exactly the same as that of the original system of equations. One of the general classes of solutions for Boolean equations is the subsumptive general solution, … …Journal of Mathematics and Statistics, Vol. 10, Issue 2 · 13 Mar 2014 · 7,109 accessesView PDFCite
Research ArticleOpen accessIn the abstractTraversal Algorithm for Complete CoverageKavitha Thiayagarajan, Coimbatore Ganeshsankar BalajiThere are many applications which require complete coverage and obstacle avoidance. The classical A* algorithm provides the user a shortest path by avoiding the obstacle. As well, the Dijkstra’s algorithm finds the shortest path between the source and destination. But in many applications we require complete coverage of the proposed area with obstacle avoidance. There are LSP, LSSP, BSA, spiral-STC … …Journal of Computer Science, Vol. 8, Issue 12 · 15 Dec 2012 · 7,120 accessesView PDFCite
Research ArticleOpen accessIn the abstractConsistent and Proficient Algorithm for Data Gathering in Wireless Sensor NetworksP. Balamurugan, K. DuraiswamyProblem statement: A wireless sensor network is usually deployed in a harsh geographical area to gather data that can be delivered to the remotely located base station. Sensor nodes have irreplaceable energy source, limited computational capability and limited memory. It is a challenge to maximize the use of energy of these sensor nodes to extend the network lifetime. Approach: This … …Journal of Computer Science, Vol. 7, Issue 9 · 25 Jul 2011 · 6,732 accessesView PDFCite