Results 161 to 170 of about 4,096,731 (342)
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
, 2010 Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Discrete & Computational Geometry, 2015 An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum of some of the triples that gives weight zero to each 2-set. Our aim in this paper is to consider the following question: how large can the girth of an oriented 3-graph (on $n$
Imre Leader, Ta Sheng Tan
openaire +4 more sources
Conformational Switching of Proteins on Material Surfaces Enabled by Peptide‐Oriented Adsorption
Advanced Functional Materials, EarlyView.Responsive biointerfaces could be achieved using conformationally responsive proteins; however, their interconversion can be lost upon surface adsorption. Herein, we demonstrate that the incorporation a Au binding peptide into calmodulin allows for binding control on Au wherein the protein retains conformational switching. This capability was confirmed
Sakthirupini Ramamurthy +7 more
wiley +1 more source
The Oriented Graph Complexes [PDF]
, 2021 The oriented graph complexes $${GC^{or}_n}$$ G C n o r are complexes of directed graphs without directed cycles. They govern, for example, the quantization of Lie bialgebras and infinite dimensional deformation quantization. Similar to the ordinary graph
Willwacher, Thomas
core
Discrete Mathematics, 1976 AbstractIt is shown that every maximal planar graph (triangulation) can be contracted at an arbitrary point (by identifying it with an adjacent point) so that triangularity is preserved. This is used as a lemma to prove that every triangulation can be (a) oriented so that with three exceptions every point has indegree three, the exceptions having ...
openaire +3 more sources
Advanced Functional Materials, EarlyView.This study advances SafeWax, a bio‐inspired, fatty‐acids‐based superhydrophobic coating, by identifying an agriculturally compliant solvent and revealing how solvent‐controlled Fatty acid crystallization governs the coating's microscopic structure and performance.
Niv Ben‐Arie +13 more
wiley +1 more source
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
Orientable Burning Number of Graphs
Discrete Applied MathematicsIn this paper, we introduce the problem of finding an orientation of a given undirected graph that maximizes the burning number of the resulting directed graph. We show that the problem is polynomial-time solvable on Kőnig-Egerváry graphs (and thus on bipartite graphs) and that an almost optimal solution can be computed in polynomial time for perfect ...
Julien Courtiel +4 more
openaire +6 more sources
Arbitrary Orientations of Hamilton Cycles in Oriented Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 We use a randomised embedding method to prove that for all $\alpha>0$ any sufficiently large oriented graph $G$ with minimum in-degree and out-degree $\delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G|$ contains every possible orientation of a Hamilton cycle. This confirms a conjecture of Häggkvist and Thomason.
openaire +4 more sources