Results 1 to 10 of about 448,992 (178)
Combination of interval-valued neutrosophic soft sets and graph theory
New Trends in Mathematical Science, 2018 In this paper, we combine the concepts of interval-valued neutrosophic soft set and graph theory. We introduce notations of interval-valued neutrosophic soft graph and complete interval-valued neutrosophic soft graph. We also present several different types operations including cartesian product, union and intersection on interval-valued neutrosophic ...
Guven Kara, Yıldıray Çelik
openaire +1 more source
Simplicial decompositions of graphs: a survey of applications [PDF]
, 1989 We survey applications of simplicial decompositions (decompositions by separating complete subgraphs) to problems in graph theory. Among the areas of application are excluded minor theorems, extremal graph theorems, chordal and interval graphs, infinite ...
Diestel, Reinhard
core +1 more source
Kernel Bounds for Structural Parameterizations of Pathwidth [PDF]
, 2012 Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k.
B. Monien +14 more
core +1 more source
Axiomatic characterization of the interval function of a graph [PDF]
, 2008 A fundamental notion in metric graph theory is that of the interval function I : V × V → 2V – {∅} of a (finite) connected graph G = (V,E), where I(u,v) = { w | d(u,w) + d(w,v) = d(u,v) } is the interval between u and v.
Mulder, H.M. (Martyn), Nebesky, L.
core +1 more source
Optimal Control Synthesis of Timed Event Graphs With Interval Model Specifications [PDF]
, 2010 The purpose of this technical note is the optimal control synthesis of a timed event graph when the state and control trajectories should follow the specifications defined by an interval model.
M.K.Didi Alaoui, P. Declerck
core +2 more sources
Distributed Computation in Dynamic Networks [PDF]
, 2009 In this report we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen by an adversary, and nodes do ...
Kuhn, Fabian +2 more
core +4 more sources
Coherent structure colouring: identification of coherent structures from sparse data using graph theory [PDF]
, 2016 We present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number, as is the case in many fluid mechanics applications of practical interest. The method, based on principles used in graph
Dabiri, John O. +1 more
core +3 more sources
Computing Role Assignments of Proper Interval Graphs in Polynomial Time [PDF]
, 2011 A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G.
Heggernes, P. +4 more
core +2 more sources
Theory and Application of Interval-Valued Neutrosophic Line Graphs
Journal of MathematicsNeutrosophic graphs are used to model inconsistent information and imprecise data about any real-life problem. It is regarded as a generalization of intuitionistic fuzzy graphs. Since interval-valued neutrosophic sets are more accurate, compatible, and flexible than single neutrosophic sets, interval-valued neutrosophic graphs (IVNGs) were defined. The
Keneni Abera Tola +2 more
openaire +2 more sources
A lower bound for nodal count on discrete and metric graphs
, 2006 According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th ...
A.M. Duval +17 more
core +3 more sources