Results 41 to 50 of about 428,321 (154)
Reduced clique graphs of chordal graphs
, 2012 We investigate the properties of chordal graphs that follow from the well-known fact that chordal graphs admit tree representations. In particular, we study the structure of reduced clique graphs which are graphs that canonically capture all tree ...
Habib, Michel +3 more
core +1 more source
Chordal graphs with bounded tree-width
, 2023 Given t≥2 and 0≤k≤t, we prove that the number of labelled k-connected chordal graphs with n vertices and tree-width at most t is asymptotically cn−5/2γnn!, as n→∞, for some constants c,γ>0 depending on t and k.
Castellví, Jordi; orcid: +3 more
core +1 more source
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Journal of Graph Algorithms and Applications, 2012 We introduce a notion of simultaneity for any class of graphs with an intersection representation (interval graphs, chordal graphs, etc.) and for comparability graphs, which are represented by transitive orientations.
Krishnam Raju Jampani, Anna Lubiw
doaj +1 more source
Chordal Graphs as Intersection Graphs of Pseudosegments
, 2007 We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a construction which shows that all chordal graphs which have a representation as intersection graph of subpaths on a tree are ...
Felsner, Stefan, Dangelmayr, Cornelia
core +1 more source
Several results on chordal bipartite graphs [PDF]
, 1997 summary:The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite ...
Bono, Aaron, Bakonyi, Mihály
core +1 more source
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source
Efficient (j, k)-Dominating Functions
Discussiones Mathematicae Graph Theory, 2023 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
Graph searching on chordal graphs
, 2012 [[abstract]]Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs[[fileno]]2030209030014[[department ...
Peng, Sheng-Lung;Ko, Ming-Tat;Ho, Chin-Wen;Hsu, Tsan-sheng;Tang, Chuan-Yi
core +1 more source
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Universal Journal of Mathematics and Applications, 2019 Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj +1 more source
Cohen-Macaulay weighted chordal graphs [PDF]
, 2023 In this paper I give a combinatorial characterization of all the Cohen-Macaulay weighted chordal graphs.
Wei, Shuai
core