Results 61 to 70 of about 919,306 (297)
Forbidden subgraphs in reduced power graphs of finite groups
AIMS Mathematics, 2021 Let G be a finite group. The reduced power graph of G is the undirected graph whose vertex set consists of all elements of G, and two distinct vertices x and y are adjacent if either ⟨x⟩⊂⟨y⟩ or ⟨y⟩⊂⟨x⟩. In this paper, we show that the reduced power graph
Huani Li , Ruiqin Fu, Xuanlong Ma
doaj +1 more source
Carpathian Journal of Mathematics, 2021 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
openaire +1 more source
Discrete Mathematics, 2003 This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire +2 more sources
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs [PDF]
, 2019 A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that, for each node, its neighborhood in T induces a connected sub- graph in G.
CALAMONERI, Tiziana +2 more
core +1 more source
Graph Decompositions and Factorizing Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for
Christian Capelle +2 more
doaj +3 more sources
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj +1 more source
On the pathwidth of chordal graphs
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Dominating cliques in chordal graphs
Discrete Mathematics, 1994 A graph \(G\) is chordal if every cycle of length exceeding 3 has a chord, i.e. an edge joining two nonconsecutive vertices in the cycle. A chordal graph is called strongly chordal if every cycle of even length exceeding 5 has an odd chord, i.e. a chord joining two nonconsecutive vertices of odd distance apart in the cycle.
Anna Lubiw +2 more
openaire +2 more sources
, 2013 It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free.
A. Conca +16 more
core +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source