Results 61 to 70 of about 120,514 (220)
On the 2-token graph of a graph
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
J. Deepalakshmi +3 more
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Early use of the reinforced concrete in the architecture of the Historicism in Austria–Hungary
Structural Concrete, EarlyView.Abstract The study examines the early incorporation of reinforced concrete in the architecture of Historicism in Austria–Hungary. Spanning the late 19th to early 20th centuries, the research illuminates the period's stylistic pluralism and the transformative impact of reinforced concrete.
Éva Lovra, Zoltán Bereczki
wiley +1 more source
A new construction for vertex decomposable graphs [PDF]
Transactions on Combinatorics, 2016 Let G be a finite simple graph on the vertex set V(G) and let S⊆V(G). Adding a whisker to G at x means adding a new vertex y and edge xy to G where x∈V(G). The graph G∪W(S) is obtained from G by adding a whisker to every vertex of S. We prove that if G∖S
Nasser Hajisharifi, Abolfazl Tehranian
doaj
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
Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
Electronic Journal of Graph Theory and Applications, 2020 For any non-abelian group G, the non-commuting graph of G, Γ=ΓG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and ...
Hamideh Hasanzadeh Bashir +1 more
doaj +1 more source
An Algorithm for Generating Strongly Chordal Graphs [PDF]
arXiv, 2018 Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not aware of any algorithm that can generate instances of this class, often necessary for testing purposes.
arxiv
Structural Concrete, EarlyView.Abstract Gerber half‐joints, broadly used in the last century as elements of concrete bridges, are prone to corrosion‐induced deterioration, which may lead to brittle shear collapse. It is of paramount importance to develop advanced numerical models for simulating the collapse behavior of Gerber half‐joints, taking material deterioration into account ...
Dario De Domenico +4 more
wiley +1 more source
On a Class of Graphs with Large Total Domination Number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj +1 more source
Strongly Chordal Graph Generation using Intersection Graph Characterisation [PDF]
arXiv, 2019 Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar characterisation for chordal graphs. Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm
arxiv