Results 61 to 70 of about 428,321 (154)
A Separator Theorem for Chordal Graphs
, 1982 Chordal graphs are undirected graphs in which every cycle of length at least four has a chord. They are sometimes called rigid circuit graphs or perfect elimination graphs; the last name reflects their utility in modelling Gaussian elimination on ...
Gilbert, John R., Rose, Donald J.
core +5 more sources
A new method for computing the vertex PI index with applications to special classes of graphs
AKCE International Journal of Graphs and CombinatoricsThe Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +1 more source
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
New proofs for strongly chordal graphs and chordal bipartite graphs
, 2004 We give new proofs of well-known characterizations of strongly chordal graphs and chordal bipartite graphs. The key ingredient is the dual hypertree structure for totally balanced hypergraphs.
Jacent Tokaz +2 more
core
Relaxations of the weakly chordal condition in graphs [PDF]
, 2021 Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. Upon reading their definitions it is clear that the weakly chordal class of graphs is a relaxation of the chordal condition for graphs.
Hathcock, Benjamin Lee
core
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
Clique roots of K4-free chordal graphs
Electronic Journal of Graph Theory and Applications, 2019 The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G.
Hossein Teimoori Faal
doaj +1 more source
Introducing subclasses of basic chordal graphs [PDF]
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph.
De Caria, Pablo Jesús +1 more
core
A decomposition theorem for chordal graphs and its applications
, 2009 We introduce a special decomposition, the so-called split-minors, of the reduced clique graphs of chordal graphs. Using this notion, we characterize asteroidal sets in chordal graphs and clique trees with minimum number of ...
Habib, Michel +3 more
core +1 more source
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source