Results 21 to 30 of about 942,960 (263)
Minimal toughness in special graph classes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Let $t$ be a positive real number. A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components, and all graphs are considered 0-tough. The toughness of a graph is the largest $t$ for which
Gyula Y. Katona, Kitti Varga
doaj +1 more source
Polynomial kernels for edge modification problems towards block and strictly chordal graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block graph or
Maël Dumas +3 more
doaj +1 more source
Chordal graphs, higher independence and vertex decomposable complexes [PDF]
International journal of algebra and computation, 2021 Given a simple undirected graph $G$ there is a simplicial complex $\mathrm{Ind}(G)$, called the independence complex, whose faces correspond to the independent sets of $G$.
F. M. Abdelmalek +4 more
semanticscholar +1 more source
On the Complexity of Finding a Sun in a Graph [PDF]
, 2010 The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core +2 more sources
Exploiting chordal structure in polynomial ideals: a Gr\"obner bases approach [PDF]
, 2016 Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas.
Cifuentes, Diego, Parrilo, Pablo
core +2 more sources
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Determining what sets of trees can be the clique trees of a chordal graph
Journal of the Brazilian Computer Society, 2012 Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way.
Pablo De Caria, M. Gutierrez
semanticscholar +1 more source
The vertex leafage of chordal graphs [PDF]
, 2011 Every chordal graph $G$ can be represented as the intersection graph of a collection of subtrees of a host tree, a so-called {\em tree model} of $G$. The leafage $\ell(G)$ of a connected chordal graph $G$ is the minimum number of leaves of the host tree ...
Buneman +19 more
core +1 more source
Graph Extremities Defined by Search Algorithms
Algorithms, 2010 Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat +3 more
doaj +1 more source
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceCover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P=(V,\le)$ with vertex set $V$, and the edge-set is the union of edge sets of the cover graph and the incomparability graph of ...
Arun Anil, Manoj Changat
doaj +1 more source