Repository logo
Davao del Sur State CollegeDSSCInstitutional Repository
 

Journal articles published externally

Permanent URI for this collectionhttps://hdl.handle.net/20.500.14578/2

Browse

Filters

20222

Settings

Start date: 2020Has files: No

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Classification system of Trichoderma culture grown in coco-water based on RGB using TensorFlow with prototype
    Alba, Felomino (Elsevier, 2022-07)
    The Trichoderma Classification system based on color code texture of potato dextrose agar solid (PDA) using TensorFlow with Prototype is a desktop application system that can classify the solid Trichoderma whether good or contaminated and determine the healthy ready to harvest. This desktop application system would develop to follow the standard of Quality Control of the Trichoderma laboratory and to automate the manual process of the classification in time for harvest. From the series of testing of Trichoderma Classification system based on color code texture of potato dextrose agar solid (PDA) using TensorFlow with Prototype, the proponent concludes that in creating the desktop application system it must be tested first to know if it was working well or not. As a result, when it comes to final implementation, there will be fewer issues. As of now, the desktop application system was functioning.
  • No Thumbnail Available
    Item
    A variant of hop domination in graphs
    Canoy, Sergio R., Jr.; Salasalan, Gemma P. (New York Business Global, 2022)
    Let G be a connected graph with vertex and edge sets V (G) and E(G), respectively. A set S ⊆ V (G) is a hop dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such that dG(v, w) = 2. A set S ⊆ V (G) is a super hop dominating set if ehpnG(v, V (G) \ S) ̸= ∅ for each v ∈ V (G) \ S, where ehpnG (v, V (G) \ S) is the set containing all the external hop private neighbors of v with respect to V (G) \ S. The minimum cardinality of a super hop dominating set of G, denoted by γ s h (G), is called the super hop domination number of G. In this paper, we investigate the concept and study it for graphs resulting from some binary operations. Specifically, we characterize the super hop dominating sets in the join, and lexicographic products of graphs, and determine bounds of the super hop domination number of each of these graphs.