Results 71 to 80 of about 149 (111)
Characterizations of connected orthogonality graphs of projections of Rickert *-rings
, 2019 In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a graph theoretic condition for an ortholattice to be orthomodular.
Waphare, B.N., Patil, Avinash A.
core
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
An Intrinsic Homotopy Theory for Simplicial Complexes, with Applications to Image Analysis
, 1999 . A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can be
Marco Grandis
core
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
Structural Results For Two-Connected Networks With Rings Of Bounded Cardinality
, 1999 . We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb ...
M. Labbé, B. Fortz
core
A Note on the Interval Function of a Disconnected Graph
Discussiones Mathematicae Graph Theory, 2018 In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Changat Manoj +3 more
doaj +1 more source
Hamiltonian properties of locally connnected graphs with bounded vertex degree
, 2009 We consider the existence of hamiltonian cycles for locally connected graphs with a bounded vertex degree. For a graph G, let ¢(G) and ±(G) denote the maximum and minimum vertex degrees, respectively.
Strusevich, Vitaly A. +3 more
core
On Radio Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 Given a graph G and a vertex coloring c, G is called l-radio connected if between any two distinct vertices u and v there is a path such that coloring c restricted to that path is an l-radio coloring.
Marinescu-Ghemeci Ruxandra
doaj +1 more source
A Note On k Best Solutions To The Chinese Postman Problem
, 1993 . The K-best problems on combinatorial optimization problems, in which K best solutions are considered instead of an optimal solution under the same conditions, have widely been studied. In this paper, we consider the K-best problem on the famous Chinese
Yasufumi Saruwatari, Tomomi Matsui
core
Some Results on the Structure of Multipoles in the Study of Snarks ∗
, 2014 AMS classification: 05C15, 05C05, 05C38. Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole M has dangling edges with one free end, which we call semiedges.
J. Vilaltella, M. A. Fiol
core