On locally finite ordered rooted trees and their rooted subtrees

DOI10.1016/J.DAM.2024.08.014MaRDI QIDQ6648245

Elie Alhajjar, Geir Agnarsson, Aleyah Dawkins

Publication date: 4 December 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

ordered rooted treesweighted ordered treesgame-over security model

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A review of attack graph and attack tree visual syntax in cyber security
• A proof of Dilworth's decomposition theorem for partially ordered sets
• A decomposition theorem for partially ordered sets
• On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem
• The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems
• Leaf-induced subtrees of leaf-Fibonacci trees
• On the Number of Subtrees of a Symmetricn-Ary Tree
• Information Security and Cryptology - ICISC 2005

This page was built for publication: On locally finite ordered rooted trees and their rooted subtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648245)