Results 11 to 20 of about 655,680 (212)
A graph \(G=(V, E)\) is a chordal probe graph if there exists a partition \(V=P\cup N\) with a stable set \(N\) and a completion \(E'\subseteq\{uv : u\not= v\in N\}\) such that the graph \((V, E\cup E')\) is a chordal graph. Chordal probe graphs generalize probe interval graphs introduced by P. Zhang; see also [\textit{F. R. McMorris, C.
Martin Charles Golumbic +1 more
openaire +5 more sources
The leafage of a chordal graph [PDF]
19 pages, 3 ...
In-Jen Lin +2 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Herzog +2 more
openaire +2 more sources
Connected graph searching in chordal graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nisse, Nicolas
openaire +2 more sources
Semipaired Domination in Some Subclasses of Chordal Graphs [PDF]
A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each set are at distance at most $2$. The semipaired domination number, denoted
Michael A. Henning +2 more
doaj +1 more source
Efficient (j, k)-Dominating Functions
For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2, . . ., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship between the
Klostermeyer William F. +3 more
doaj +1 more source
On the End-Vertex Problem of Graph Searches [PDF]
End vertices of graph searches can exhibit strong structural properties and are crucial for many graph algorithms. The problem of deciding whether a given vertex of a graph is an end-vertex of a particular search was first introduced by Corneil, K\"ohler
Jesse Beisegel +6 more
doaj +1 more source
Polynomial kernels for edge modification problems towards block and strictly chordal graphs [PDF]
We 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
An Edge-Signed Generalization of Chordal Graphs, Free Multiplicities on Braid Arrangements, and Their Characterizations [PDF]
In this article, we propose a generalization of the notion of chordal graphs to signed graphs, which is based on the existence of a perfect elimination ordering for a chordal graph. We give a special kind of filtrations of the generalized chordal graphs,
Takuro Abe, Koji Nuida, Yasuhide Numata
doaj +1 more source
Minimal toughness in special graph classes [PDF]
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

