Results 51 to 60 of about 855 (105)
Lower and upper bounds of shortest paths in reachability graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 57, Page 3023-3036, 2004., 2004 We prove the following property for safe marked graphs, safe conflict‐free Petri nets, and live and safe extended free‐choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T| − 1) · |T|/2.
P. K. Mishra
wiley +1 more source
On dynamic network security: A random decentering algorithm on graphs
Open Mathematics, 2018 Random Decentering Algorithm (RDA) on a undirected unweighted graph is defined and tested over several concrete scale-free networks. RDA introduces ancillary nodes to the given network following basic principles of minimal cost, density preservation ...
Trobajo M.T. +2 more
doaj +1 more source
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +1 more source
On the smallest snarks with oddness 4 and connectivity 2 [PDF]
, 2018 A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubic graph is the minimum number of odd components in any 2-factor of the graph. Lukot'ka, M\'acajov\'a, Maz\'ak and \v{S}koviera showed in [Electron.
Goedgebeur, Jan
core +2 more sources
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 11, Page 679-684, 2001., 2001 For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP), using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle, and uses m Boolean variables, where m is the number of the edges of a graph.
Anatoly D. Plotnikov
wiley +1 more source
Interval-Valued Fuzzy Soft Graphs
Topological Algebra and its Applications, 2017 In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
Long cycles in certain graphs of large degree
International Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 10, Page 691-697, 2000., 2000 Let G be a connected graph of order n and X = {x ∈ V : d(x) ≥ n/2}. Suppose |X| ≥ 3 and G satisfies the modified Fan′s condition. We show that the vertices of the block B of G containing X form a cycle. This generalizes a result of Fan. We also give an efficient algorithm to obtain such a cycle. The complexity of this algorithm is O(n2). In case G is 2‐
Pak-Ken Wong
wiley +1 more source
Path-induced closure operators on graphs for defining digital Jordan surfaces
Open Mathematics, 2019 Given a simple graph with the vertex set X, we discuss a closure operator on X induced by a set of paths with identical lengths in the graph. We introduce a certain set of paths of the same length in the 2-adjacency graph on the digital line ℤ and ...
Šlapal Josef
doaj +1 more source
Algorithmic aspects of bipartite graphs
International Journal of Mathematics and Mathematical Sciences, Volume 18, Issue 2, Page 299-304, 1995., 1995 We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill‐in of a given ordered graph.
Mihály Bakonyi, Erik M. Varness
wiley +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source