Results 31 to 40 of about 1,022,735 (236)
On the size of edge chromatic 5-critical graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this paper, we study the size of edge chromatic 5-critical graphs in several classes of 5-critical graphs. In most of the classes of 5-critical graphs in this paper, we have obtained their exact size and in the other classes of 5-critical graphs, we ...
K. Kayathri, J. Sakila Devi
doaj +1 more source
Block circulant graphs and the graphs of critical pairs of crowns
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
Statistical mechanics on isoradial graphs [PDF]
, 2010 Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality.
Boutillier, Cédric +1 more
core +3 more sources
Some Results on Path-Factor Critical Avoidable Graphs
Discussiones Mathematicae Graph Theory, 2023 A path factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. We write P≥k = {Pi : i ≥ k}. Then a P≥k-factor of G means a path factor in which every component admits at least k vertices, where k ≥ 2 is ...
Zhou Sizhong
doaj +1 more source
Robustness of Random Graphs Based on Natural Connectivity [PDF]
, 2010 Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number ...
Barahona, Mauricio +3 more
core +1 more source
Weakly connected domination critical graphs [PDF]
Opuscula Mathematica, 2008 A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
Connected domination critical graphs
Applied Mathematics Letters, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xue-Gang, Sun, Liang, Ma, De-Xiang
openaire +1 more source
BioMedInformatics, 2023 Semantic web technologies (SWT) represent data in a format that is easier for machines to understand. Validating the knowledge in data graphs created using SWT is critical to ensure that the axioms accurately represent the so-called “real” world. However,
Rashmi Burse +2 more
doaj +1 more source
Small clique number graphs with three trivial critical ideals
Special Matrices, 2018 The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source
Critical graphs with Roman domination number four
AKCE International Journal of Graphs and Combinatorics, 2020 A Roman domination function on a graph G is a function satisfying the condition that every vertex u for which r(u) = 0 is adjacent to at least one vertex v for which r(v) = 2.
A. Martínez-Pérez, D. Oliveros
doaj +1 more source