Results 51 to 60 of about 772 (221)
Applied Stochastic Models in Business and Industry, Volume 41, Issue 6, November/December 2025.ABSTRACT Malware detection poses a critical challenge for both society and Business and Industry (B&I), particularly given the necessity for secure digital transformation. Among various cybersecurity threats, ransomware has emerged as especially disruptive, capable of halting operations, interrupting business continuity, and causing significant ...
Danilo Bruschi +3 more
wiley +1 more source
Graphs whose Laplacian eigenvalues are almost all 1 or 2
Special MatricesWe explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
Mohammadian Ali, Xu Shanshan
doaj +1 more source
Spanning Plane Subgraphs of 1‐Plane Graphs
Journal of Graph Theory, Volume 110, Issue 3, Page 290-297, November 2025.ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi +2 more
wiley +1 more source
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +1 more source
Characterising and recognising game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Consider a vertex colouring game played on a simple graph with $k$ permissible colours. Two players, a maker and a breaker, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours.
Dominique Andres, Edwin Lock
doaj +1 more source
List-3-Coloring ordered graphs with a forbidden induced subgraph [PDF]
, 2022 Sepehr Hajebi, Yanjia Li, Sophie Spirkl
openalex +1 more source
Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 28, Page 5325-5350, 28 November 2025.Abstract Road networks face increasing disruptions, yet vulnerability assessment methods either oversimplify traffic dynamics or require extensive computational simulations. This research introduces a novel approach integrating traffic simulation, graph theory, and machine learning for efficient and accurate vulnerability assessment.
Abdel Rahman Marian +2 more
wiley +1 more source
Forbidden subgraphs, stability and hamiltonicity
Discrete Mathematics, 1999 The authors study the stability of some classes of claw-free graphs defined in terms of forbidden subgraphs under the closure operation defined in \textit{Z. Ryjáček} [J. Comb. Theory, Ser. B 70, No.~2, 217-224 (1997; Zbl 0872.05032)]. They characterize all connected graphs \(A\) such that the class of all \(CA\)-free graphs (where \(C\) denotes the ...
Brousek, Jan +2 more
openaire +2 more sources
Theory and Applications of GraphsA class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh +2 more
doaj +1 more source