Log in

Relevant bibliographies by topics / Chordal graph

Contents

Journal articles

Academic literature on the topic 'Chordal graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Chordal graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Chordal graph"

1

Jeya Jothi, R. Mary, and A. Amutha. "Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs." Mapana - Journal of Sciences 11, no. 4 (2012): 121–31. http://dx.doi.org/10.12723/mjs.23.10.

Full text

Abstract:

A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles. We have given the characterization of Super Strongly Perfect graphs in chordal and strongly chordal graphs. We have presented the results of Chordal graphs in terms of domination and co - domination numbers γ and . We have given the relationship between diameter, domination and co - domination numbers of chordal graphs. Also w

APA, Harvard, Vancouver, ISO, and other styles

2

Nguyen, Ngoc Tuy, Jörg Bornemann, and Van Bang Le. "Graph classes related to chordal graphs and chordal bipartite graphs." Electronic Notes in Discrete Mathematics 27 (October 2006): 73–74. http://dx.doi.org/10.1016/j.endm.2006.08.062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Şeker, Oylum, Pinar Heggernes, Tinaz Ekim, and Z. Caner Taşkın. "Generation of random chordal graphs using subtrees of a tree." RAIRO - Operations Research 56, no. 2 (2022): 565–82. http://dx.doi.org/10.1051/ro/2022027.

Full text

Abstract:

Chordal graphs form one of the most studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of problems among the latter, approximation algorithms, parameterized algorithms, and algorithms with moderately exponential or sub-exponential running time have been designed. Chordal graphs have also gained increasing interest during the recent years in the area of enumeration algorithms. Being able to test these algorithms on instances of chordal graphs is crucial for understa

APA, Harvard, Vancouver, ISO, and other styles

4

Uehara, Ryuhei, Seinosuke Toda, and Takayuki Nagoya. "Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs." Discrete Applied Mathematics 145, no. 3 (2005): 479–82. http://dx.doi.org/10.1016/j.dam.2004.06.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bermudo, Sergio, Walter Carballosa, José Rodríguez, and José Sigarreta. "On the hyperbolicity of edge-chordal and path-chordal graphs." Filomat 30, no. 9 (2016): 2599–607. http://dx.doi.org/10.2298/fil1609599b.

Full text

Abstract:

If X is a geodesic metric space and x1, x2, x3 ( X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is ?-hyperbolic (in the Gromov sense) if any side of T is contained in a ?-neighborhood of the union of the other two sides, for every geodesic triangle T in X. An important problem in the study of hyperbolic graphs is to relate the hyperbolicity with some classical properties in graph theory. In this paper we find a very close connection between hyperbolicity and chordality: we extend the classical definition of chordality in

APA, Harvard, Vancouver, ISO, and other styles

6

Nisse, Nicolas. "Connected graph searching in chordal graphs." Discrete Applied Mathematics 157, no. 12 (2009): 2603–10. http://dx.doi.org/10.1016/j.dam.2008.08.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bender, E. A., L. B. Richmond, and N. C. Wormald. "Almost all chordal graphs split." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 38, no. 2 (1985): 214–21. http://dx.doi.org/10.1017/s1446788700023077.

Full text

Abstract:

AbstractA chordal graph is a graph in which every cycle of length at least 4 has a chord. If G is a random n-vertex labelled chordal graph, the size of the larget clique in about n/2 and deletion of this clique almost surely leaves only isolated vertices. This gives the asymptotic number of chordal graphs and information about a variety of things such as the size of the largest clique and connectivity.

APA, Harvard, Vancouver, ISO, and other styles

8

Sun, Wenbo, and Ivona Bezáková. "Sampling Random Chordal Graphs by MCMC (Student Abstract)." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 10 (2020): 13929–30. http://dx.doi.org/10.1609/aaai.v34i10.7237.

Full text

Abstract:

Chordal graphs are a widely studied graph class, with applications in several areas of computer science, including structural learning of Bayesian networks. Many problems that are hard on general graphs become solvable on chordal graphs. The random generation of instances of chordal graphs for testing these algorithms is often required. Nevertheless, there are only few known algorithms that generate random chordal graphs, and, as far as we know, none of them generate chordal graphs uniformly at random (where each chordal graph appears with equal probability). In this paper we propose a Markov

APA, Harvard, Vancouver, ISO, and other styles

9

McKee, Terry A. "Symmetric graph-theoretic roles of two-pairs and chords of cycles." Discrete Mathematics, Algorithms and Applications 06, no. 03 (2014): 1450031. http://dx.doi.org/10.1142/s1793830914500311.

Full text

Abstract:

Although the notion of a two-pair (a pair of vertices between which all induced paths have length 2) was invented for the class of weakly chordal graphs, two-pairs can also play a fundamental role for smaller graph classes. Indeed, two-pairs and chords of cycles can collaborate symmetrically to give parallel characterizations of weakly chordal, chordal, and strongly chordal graphs (and of distance-hereditary graphs).

APA, Harvard, Vancouver, ISO, and other styles

10

TALMACIU, MIHAI. "On Hyper-Chordal graphs." Carpathian Journal of Mathematics 37, no. 1 (2021): 119–26. http://dx.doi.org/10.37193/cjm.2021.01.12.

Full text

Abstract:

Triangulated graphs have many interesting properties (perfection, recognition algorithms, combinatorial optimization algorithms with linear complexity). Hyper-triangulated graphs are those where each induced subgraph has a hyper-simplicial vertex. In this paper we give the characterizations of hyper-triangulated graphs using an ordering of vertices and the weak decomposition. We also offer a recognition algorithm for the hyper-triangulated graphs, the inclusions between the triangulated graphs generalizations and we show that any hyper-triangulated graph is perfect.

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!