Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Set Theory
(R2139) Italian Domination Number For Some Classes Of Trees, Amritha Prakash, Ragukumar Pandurangan
(R2139) Italian Domination Number For Some Classes Of Trees, Amritha Prakash, Ragukumar Pandurangan
Applications and Applied Mathematics: An International Journal (AAM)
For a graph G with vertex set V , an Italian dominating function is a function f from V to {0, 1, 2} which has the property that for every vertex which is assigned 0, it must either adjacent to a vertex assigned 2 under f or adjacent to at least two vertices assigned 1 under f. The weight of an Italian dominating function is the sum of all weights assigned to the vertices. The minimum weight of an Italian dominating function f is the Italian domination number. Finding a graph’s Italian domination number is a well-known NP-Complete problem. Even …
Toward Completeness Theorem For Guarded Kleene Algebra With Tests, Hung Pham
Toward Completeness Theorem For Guarded Kleene Algebra With Tests, Hung Pham
Honors Theses
Code refactoring is a fundamental practice in software engineering, in which a program is restructured without changing the actions it performs and the results it produces. To carry out refactoring with confidence, one requires a formal method for verifying that two programs are equivalent. Guarded Kleene Algebra with Tests (GKAT) provides such a framework, an algebraic system designed to reason about a natural class of programs, namely those in which every branch and loop is governed by a Boolean condition, such as if–else and while statements. Central to GKAT is a finite set of algebraic axioms for deriving program equivalences. …