Browsing by Subject "Graph theory"
Now showing items 21-40 of 657
-
A mathematical model for dynamic memory networks
(Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessThe aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A ... -
A new application of the $\otimes_h$-product to $\alpha$-labelings
(2015)
Article
Open AccessThe weak tensor product was introduced by Snevily as a way to construct new graphs that admit a-labelings from a pair of known a-graphs. In this article, we show that this product and the application to a-labelings can be ... -
A new approach to gross error detection for GPS networks
(2019-05-29)
Article
Open AccessWe present a new matrix-based approach to detect and correct gross errors in GPS geodetic control networks. The study is carried out by introducing a new matrix, whose entries are powers of a (real or complex) variable, ... -
A new approach to the spectral excess theorem for distance-regular graphs
(2009-04-01)
Article
Open AccessThe Spectral Excess Theorem provides a quasi-spectral characterization for a (regular) graph $\Gamma$ with $d+1$ different eigenvalues to be distance-regular graph, in terms of the mean (d-1)-excess of its vertices.\ The ... -
A new class of polynomials from the spectrum of a graph, and its application to bound the k-independence number
(Elsevier, 2020-11-15)
Article
Open AccessThe k-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than k. A graph is called k-partially walk-regular if the number of closed walks of a given length l = k, rooted ... -
A new general family of mixed graphs
(2019-01-11)
Article
Open AccessA new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute ... -
A new lower bound on the maximum number of plane graphs using production matrices
(2019-11-01)
Article
Open AccessWe use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(42.11n ) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n ) by Aichholzer ... -
A note on a new general family of deterministic hierarchical networks
(2019-06-01)
Article
Open AccessHierarchical network; Small-word; Scale-free; Routing algorithm; Diameter; Clustering -
A note on the degree sequences of graphs with restrictions
(2008-01-15)
Article
Open AccessDegree sequences of some types of graphs will be studied and characterized in this paper. -
A note on the order of iterated line digraphs
(Wiley, 2016-07-27)
Article
Open AccessGiven a digraph G, we propose a new method to find the recurrence equation for the number of vertices n_k of the k-iterated line digraph L_k(G), for k>= 0, where L_0(G) = G. We obtain this result by using the minimal polynomial ... -
A polynomial bound for untangling geometric planar graphs
(2009-12)
Article
Open AccessTo untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos (Discrete Comput. Geom. 28(4): 585–592, 2002) asked if every n-vertex geometric planar ... -
A polynomial-time reduction from the multi-graph isomorphism problem to additive codeequivalence
(2021-12-02)
Article
Open AccessWe present a polynomial-time reduction from the multi-graph isomorphism problem to the problem of code equivalence of additive codes over finite extensions of the field with two elements. -
A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem
(2015)
Conference report
Open AccessWhen various kinds of products must receive the same treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can be ... -
A scalable approach to T2-MRI colon segmentation
(2020-07-01)
Article
Open AccessThe study of the colonic volume is a procedure with strong relevance to gastroenterologists. Depending on the clinical protocols, the volume analysis has to be performed on MRI of the unprepared colon without contrast ... -
A semantics of business configurations using symbolic graphs
(Institute of Electrical and Electronics Engineers (IEEE), 2015)
Conference report
Open AccessIn this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML: business configurations. To achieve this goal we use symbolic graph transformation systems. We formalize ... -
A simple proof of the spectral excess theorem for distance-regular graphs
(Elsevier, 2010-04-15)
Article
Restricted access - publisher's policyThe spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with d+1 distinct eigenvalues to be distance-regular graph, in terms of the excess (number of vertices at distance d) of each ... -
A spectral approach to Szemerédi’s Regularity Lemma
(Universitat Politècnica de Catalunya, 2021-07)
Master thesis
Open AccessSzemerédi s Regularity Lemma says that for any graph there is a partition of the vertices into a bounded number of parts such that edges between most different parts behave almost randomly. Recently, Tao gave a spectral ... -
A stochastic simplicial SIS model for complex networks
(2023-06-01)
Article
Open AccessWe propose a stochastic epidemiological model for simplicial complex networks by means of a stochastic differential equation (SDE) that extends the mean field approach of the simplicial social contagion model. We show that, ... -
A sufficient condition for Pk-path graphs being r-connected
(2007-08)
Article
Open AccessGiven an integer k≥1 and any graph G; the path graph $P_k(G)$ has for vertices the paths of length k in G, and two vertices are joined by an edge if and only if the intersection of the corresponding paths forms a path of ... -
A sufficient degree condition for a graph to contain all trees of size k
(Springer Verlag, 2011-01)
Article
Restricted access - publisher's policyThe Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
