Relevant bibliographies by topics / Strongly chordal graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Strongly chordal graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

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 'Strongly chordal graphs.'

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 "Strongly chordal graphs"

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

McKee, Terry A. "Strengthening strongly chordal graphs." Discrete Mathematics, Algorithms and Applications 08, no. 01 (2016): 1650002. http://dx.doi.org/10.1142/s1793830916500026.

Full text
Abstract:
An [Formula: see text]-chord of a cycle [Formula: see text] is a chord that forms a new cycle with a length-[Formula: see text] subpath of [Formula: see text] when [Formula: see text] is at most half the length of [Formula: see text]. Define a graph to be [Formula: see text]-strongly chordal if, for every [Formula: see text], every cycle long enough to have an [Formula: see text]-chord always has an [Formula: see text]-chord. The [Formula: see text]-strongly chordal and [Formula: see text]-strongly chordal graphs are, respectively, the chordal and strongly chordal graphs. Several characterizat
APA, Harvard, Vancouver, ISO, and other styles
3

McKee, Terry A. "Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs." Discrete Mathematics 260, no. 1-3 (2003): 231–38. http://dx.doi.org/10.1016/s0012-365x(02)00674-x.

Full text
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

McKee, Terry A. "Erratum to “Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs”." Discrete Mathematics 272, no. 2-3 (2003): 307. http://dx.doi.org/10.1016/s0012-365x(03)00254-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

McKee, Terry A. "Odd twists on strongly chordal graphs." Discrete Mathematics, Algorithms and Applications 11, no. 03 (2019): 1950034. http://dx.doi.org/10.1142/s1793830919500344.

Full text
Abstract:
Strongly chordal graphs can be characterized as chordal graphs in which every even cycle of length at least [Formula: see text] has an odd chord (a chord whose endpoints are an odd distance apart in the cycle subgraph). Define “oddly chordal graphs” to be chordal graphs in which every odd cycle of length at least [Formula: see text] has an odd chord. Strongly chordal graphs are shown to be oddly chordal, and the oddly chordal graphs are characterized by forbidding induced “double [Formula: see text]-sun” subgraphs. Both strongly chordal and oddly chordal graphs are also characterized in terms
APA, Harvard, Vancouver, ISO, and other styles
7

Dragan, Feodor F. "Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs." Discrete Applied Mathematics 99, no. 1-3 (2000): 427–42. http://dx.doi.org/10.1016/s0166-218x(99)00149-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Jin, Yi-Huang Shen, and Tongsuo Wu. "Edgewise strongly shellable clutters." Journal of Algebra and Its Applications 17, no. 01 (2018): 1850018. http://dx.doi.org/10.1142/s0219498818500184.

Full text
Abstract:
When [Formula: see text] is a chordal clutter in the sense of Woodroofe or Emtander, we show that the complement clutter is edgewise strongly shellable. When [Formula: see text] is indeed a finite simple graph, we provide additional characterization of chordal graphs from the point of view of strong shellability. In particular, the generic graph [Formula: see text] of a tree is shown to be bi-strongly shellable.
APA, Harvard, Vancouver, ISO, and other styles
9

Heggernes, Pinar, Federico Mancini, Charis Papadopoulos, and R. Sritharan. "Strongly chordal and chordal bipartite graphs are sandwich monotone." Journal of Combinatorial Optimization 22, no. 3 (2010): 438–56. http://dx.doi.org/10.1007/s10878-010-9322-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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
More sources

Dissertations / Theses on the topic "Strongly chordal graphs"

1

Hsu, Chung Chang, and 徐忠長. "On Two Location Problems in Strongly Chordal Graphs." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/00511923535022306480.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>81<br>Given a simple graph G, which is composed of the set of vertices V and the set of edges E, a set of vertices D is a dominating set if every vertex in V is adjacent to at least one vvertex in D. In this thesis, we define two terms related to the dominating set. One is k-fault tolerant dominating set which is a set D of V such that the cardinality of the intersection of D and the close neighborhood of v is greater than k for every v in V. The other is minimum
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Ya-Mei, and 陳雅玫. "The Fault Tolerant Domination Problem on Strongly Chordal Graphs." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/89509799514631971665.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>89<br>Given a graph G = (V, E) and a fault tolerant function f from V to N, a dominating set D(subset of V) is fault tolerant if | D∩N[v] | >= f(v) for all v in V. Given a graph G = (V, E) and a function g,from V to integers, the weight of g is defined as w(g) =Σ(v in V) g(v). For a vertex v in V, let g[v] =Σ(u in N[v]) g(u). A signed dominating function of G is a function g,from V to {-1,1}, such that g[v] >= 1 for all v in V. The signed domination number rs(G)(gamma_s(G)) of G is the minimum weight of a signed dominating function on G. We call a signed d
APA, Harvard, Vancouver, ISO, and other styles
3

Chu, Kuan-Ting, and 褚冠廷. "Mutual Transferability of Dominating Sets in Strongly Chordal Graphs and Cactus Graphs." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/4td2ug.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chiu, Guei-Lin, and 邱圭琳. "A Certifying Algorithm for Finding Hinge Vertices of Strongly Chordal Graphs." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/36469603676772326548.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>　　Let G = (V, E) be a graph, and let G−u be the subgraph of G induced by the vertex set V(G) − {u}. A vertex u ∈ V(G) is said to be a hinge vertex of G if and only if there exist two vertices x, y ∈ V(G − u) such that dG−u(x, y) > dG(x, y), where dG(x , y) is the distance (i.e., the length of a shortest path) between x and y in G. A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is a piece of evidence proving that the answer has not been compromised by a bug in the implementati
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Feiran. "New results on broadcast domination and multipacking." Thesis, 2015. http://hdl.handle.net/1828/6627.

Full text
Abstract:
Let G be a graph and f be a function that maps V to {0,1,2, ..., diam(G)}. Let V+ be the set of all vertices such that f(v) is positive. If for every vertex v not in V+ there exists a vertex w in V+ such that the distance between v and w is at most f(w), then f is called a dominating broadcast of G. The cost of the broadcast f is the sum of the values f(v) over all vertices v in V. The minimum cost of a dominating broadcast is called the broadcast domination number of G. A subset S of V is a multipacking if, for every v in V and for every integer k which is at least 1 and at most
APA, Harvard, Vancouver, ISO, and other styles
6

Chiang, Wei-Ling, and 江韋伶. "A Linear Time Algorithm for the Simple Moplex Ordering of a Strongly Chordal Graph." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/26826356427901784124.

Full text
Abstract:
碩士<br>國立臺北商業技術學院<br>資訊與決策科學研究所<br>102<br>Berry [A. Berry, J. P. Bordat, Moplex elimination orderings, Electronic Notes in Discrete Mathematics, 8 (2001) 6--9] proved that a graph G is choral if and only if G admits a moplex ordering. In this thesis, we also prove that a strongly chordal graph has a similar ordering namely simple moplex ordering. Then, we propose an algorithm that can be run in linear time to find such an ordering.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Strongly chordal graphs"

1

Mukhopadhyay, Asish, and Md Zamilur Rahman. "Algorithms for Generating Strongly Chordal Graphs." In Transactions on Computational Science XXXVIII. Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63170-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Heggernes, Pinar, Federico Mancini, Charis Papadopoulos, and R. Sritharan. "Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02882-3_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Uehara, Ryuhei. "Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45465-9_85.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kalyana Rama Prasad, N., and P. Sreenivasa Kumar. "On Generating Strong Elimination Orderings of Strongly Chordal Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-540-49382-2_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Confessore, G., P. Dell’Olmo, and S. Giordani. "Partitioning Cliques of Claw-Free Strongly Chordal Graphs." In Operations Research Proceedings 1998. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58409-1_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dahlhaus, Elias. "Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0023483.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lafond, Manuel. "On Strongly Chordal Graphs That Are Not Leaf Powers." In Graph-Theoretic Concepts in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68705-6_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kloks, Ton, Sheung-Hung Poon, Feng-Ren Tsai, and Yue-Li Wang. "The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs." In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29700-7_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nevries, Ragnar, and Christian Rosenke. "Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45043-3_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brandstädt, Andreas, and Martin Charles Golumbic. "Dually and strongly chordal graphs." In Topics in Algorithmic Graph Theory. Cambridge University Press, 2021. http://dx.doi.org/10.1017/9781108592376.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Strongly chordal graphs"

1

Santos, Tanilson D., Jayme Szwarcfiter, Uéverton S. Souza, and Claudson F. Bornstein. "On the Helly Property of Some Intersection Graphs." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15752.

Full text
Abstract:
An EPG graph G is an edge-intersection graph of paths on a grid. In this thesis, we analyze structural characterizations and complexity aspects regarding EPG graphs. Our main focus is on the class of B1-EPG graphs whose intersection model satisfies well-known the Helly property, called Helly-B1-EPG. We show that the problem of recognizing Helly-B1-EPG graphs is NP-complete. Besides, other intersection graph classes such as VPG, EPT, and VPT were also studied. We completely solve the problem of determining the Helly and strong Helly numbers of Bk-EPG graphs and Bk-VPG graphs for each non-negati
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Strongly chordal graphs' for particular source types:
Journal articles
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!

To the bibliography