Research ArticleOpen accessEvery word in the titleConditioned Slicing for Efficient Multiway Decision Graphs Model-CheckerSaad ElmansoriIntegrating formal verification techniques into the hardware design process provides the means to rigorously prove critical properties. However, most automatic verification techniques, such as model checking, are only effectively applicable to designs of limited sizes due to the state explosion problem. The Multiway Decision Graphs (MDG) method is an efficient method to define hardware designs into more abstract environments; however, … …Journal of Computer Science, Vol. 9, Issue 3 · 23 Apr 2013 · 6,368 accessesView PDFCite
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 accessEvery word in the titleNumber 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 accessEvery word in the titleSupport Measure Admissibility Based on Operations on Instance GraphsFord Lumban GaolThe concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no grater than that of its subpatterns, a property called anti-monotonicity or admissibility. This study examines the requirements … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,825 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA 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
EditorialOpen accessEvery word in the titleRETRACTED: Existence and Non-Existence of Super Mean Labeling on Star GraphsG. Uma Maheswari, Suzan Jabbar Obaiys, G. Margaret Joan Jebarani et al.This article has been retracted after careful consideration and internal assessment following a formal investigation into allegations of plagiarism. After careful review, it was found that substantial portions of the article—including theorems, definitions, diagrams, and proofs—were reproduced with minimal modification from previously published works without appropriate citation or acknowledgment. The reused content includes, but is not limited to, material from … …American Journal of Engineering and Applied Sciences, Vol. 13, Issue 4 · 13 Nov 2020 · 6,147 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOn 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 accessEvery word in the titleDisjoint Sets in Graphs and its Application to Electrical NetworksFord Lumban GaolProblem statement: One of the well known problems in Telecommunication and Electrical Power System is how to put Electrical Sensor Unit (ESU) in some various selected locations in the system. Approach: This problem was modeled as the vertex covering problems in graphs. The graph modeling of this problem as the minimum vertex covering set problem. Results: The degree covering set … …Journal of Mathematics and Statistics, Vol. 7, Issue 1 · 25 Mar 2011 · 7,617 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleGRAPHSJ 3: A MODERN DIDACTIC APPLICATION FOR GRAPH ALGORITHMSGianluca Costa, Claudia D’Ambrosio, Silvano MartelloIn 2009 the authors developed an open source Java application and framework, GraphsJ, to help the students in their approach to the study of graph algorithms, by guiding them to understand their logical structures through experiments on numerical instances. After four years, the availability of Java 7 and of new tools suggested the implementation of a new major release. We … …Journal of Computer Science, Vol. 10, Issue 7 · 10 Feb 2014 · 7,857 accessesView PDFCite