Results 111 to 120 of about 3,724 (174)
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Special Matrices, 2014 The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour +2 more
doaj +1 more source
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
An Exact Algorithm for Counting the Number of Independent Sets of a Graph
MathematicsFor a graph G of a degree greater than or equal to 3, counting the number of independent sets (denoted as i(G)) is a classical #P-complete problem. Here, we establish a new worst-case upper bound time complexity for computing i(G) for any non-constraint ...
Guillermo De Ita Luna +3 more
doaj +1 more source
Improved Outerplanarity Bounds for Planar Graphs
In this paper, we study the outerplanarity of planar graphs, i.e., the number of times that we must (in a planar embedding that we can initially freely choose) remove the outerface vertices until the graph is empty. It is well-known that there are $n$-vertex graphs with outerplanarity $\tfrac{n}{6}+Θ(1)$, and not difficult to show that the ...
Biedl, Therese, Mondal, Debajyoti
openaire +2 more sources
Light graphs in families of outerplanar graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
FOG: Finding outerplanar graphs
, 2006 In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications. Our system provides several features that allow a user to ask detailed mining questions and visualize the fragments found.
Ramon, Jan +3 more
openaire +1 more source
Choosability with separation of cycles and outerplanar graphs
Discussiones Mathematicae Graph Theory, 2023 Jean-Christophe Godin, Oliver Togni
doaj +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
openaire +2 more sources