Results 21 to 30 of about 1,862,441 (301)
MINORS IN WEIGHTED GRAPHS [PDF]
Bulletin of the Australian Mathematical Society, 2008 AbstractWe define the notion of minor for weighted graphs. We prove that with this minor relation, the set of weighted graphs is directed. We also prove that, given any two weights on a connected graph with the same total weight, we can transform one into the other using a sequence of edge subdivisions and edge contractions.
Joiţa, Cezar, Joiţa, Daniela
openaire +1 more source
Internally 4-Connected Graphs With No {Cube, V8}-Minor
Discussiones Mathematicae Graph Theory, 2021 A simple graph is a minor of another if the first is obtained from the second by deleting vertices, deleting edges, contracting edges, and deleting loops and parallel edges that are created when we contract edges.
Lewchalermvongs Chanun +1 more
doaj +1 more source
Small minors in dense graphs [PDF]
European Journal of Combinatorics, 2012 A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of the whole graph.
Samuel Fiorini +3 more
openaire +4 more sources
Implications of network topology on stability. [PDF]
PLoS ONE, 2015 In analogy to chemical reaction networks, I demonstrate the utility of expressing the governing equations of an arbitrary dynamical system (interaction network) as sums of real functions (generalized reactions) multiplied by real scalars (generalized ...
Ali Kinkhabwala
doaj +1 more source
Shift operators from the simplex representation in momentum-space CFT
Journal of High Energy Physics, 2023 We derive parametric integral representations for the general n-point function of scalar operators in momentum-space conformal field theory. Recently, this was shown to be expressible as a generalised Feynman integral with the topology of an (n − 1 ...
Francesca Caloro, Paul McFadden
doaj +1 more source
Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface
Кібернетика та комп'ютерні технології, 2022 Consider the problem of studying the metric properties of a subgraph G \ v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow ...
Volodymyr Petrenjuk +2 more
doaj +1 more source
Two lower bounds for $p$-centered colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a graph $G$ and an integer $p$, a coloring $f : V(G) \to \mathbb{N}$ is \emph{$p$-centered} if for every connected subgraph $H$ of $G$, either $f$ uses more than $p$ colors on $H$ or there is a color that appears exactly once in $H$. The notion of $
Loïc Dubois +4 more
doaj +1 more source
Modularity of minor‐free graphs
Journal of Graph Theory, 2022 AbstractWe prove that a class of graphs with excluded minor and with the maximum degree of smaller order than the number of edges is maximally modular, that is, for every , the modularity of any graph in the class with sufficiently many edges is at least .
Michal Lason, Malgorzata Sulkowska
openaire +2 more sources
Consensus analysis of the weighted corona networks
Frontiers in Physics, 2022 The consensus of complex networks has attracted the attention of many scholars. The graph operation is a common method to construct complex networks, which is helpful in studying the consensus of complex networks. Based on the corona networks G1◦G2, this
Weiwei Du +3 more
doaj +1 more source
Capturing Polynomial Time using Modular Decomposition [PDF]
Logical Methods in Computer Science, 2019 The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory.
Berit Grußien
doaj +1 more source