scholarly journals A variant of Niessen’s problem on degreesequences of graphs

2014 ◽  
Vol Vol. 16 no. 1 (Graph Theory) ◽  
Author(s):  
Jiyun Guo ◽  
Jianhua Yin
Keyword(s):  
Graph Theory ◽  
Discrete Math ◽  
Simple Graph ◽  
The Other ◽  
Degree Sequences ◽  
International Audience

Graph Theory International audience Let (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) be two sequences of nonnegative integers satisfying the condition that b1>=b2>=...>=bn, ai<= bi for i=1,2,\textellipsis,n and ai+bi>=ai+1+bi+1 for i=1,2,\textellipsis, n-1. In this paper, we give two different conditions, one of which is sufficient and the other one necessary, for the sequences (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) such that for every (c1,c2,\textellipsis,cn) with ai<=ci<=bi for i=1,2,\textellipsis,n and &#x2211;&limits;i=1n ci=0 (mod 2), there exists a simple graph G with vertices v1,v2,\textellipsis,vn such that dG(vi)=ci for i=1,2,\textellipsis,n. This is a variant of Niessen\textquoterights problem on degree sequences of graphs (Discrete Math., 191 (1998), 247&#x2013;253).

scholarly journals Symmetric bipartite graphs and graphs with loops

2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Grant Cairns ◽  
Stacey Mendan
Keyword(s):  
Graph Theory ◽  
Bipartite Graph ◽  
Degree Sequence ◽  
Bipartite Graphs ◽  
Degree Sequences ◽  
Graph Automorphism ◽  
International Audience ◽  
The Relationship

Graph Theory International audience We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts. To prove this, we study the relationship between symmetric bipartite graphs and graphs with loops.

scholarly journals p-box: a new graph model

2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Mauricio Soto ◽  
Christopher Thraves-Caro
Keyword(s):  
Graph Theory ◽  
Graph Model ◽  
Directed Path ◽  
Outerplanar Graphs ◽  
New Model ◽  
Model Based ◽  
Representative Element ◽  
International Audience ◽  
Graph Families

Graph Theory International audience In this document, we study the scope of the following graph model: each vertex is assigned to a box in ℝd and to a representative element that belongs to that box. Two vertices are connected by an edge if and only if its respective boxes contain the opposite representative element. We focus our study on the case where boxes (and therefore representative elements) associated to vertices are spread in ℝ. We give both, a combinatorial and an intersection characterization of the model. Based on these characterizations, we determine graph families that contain the model (e. g., boxicity 2 graphs) and others that the new model contains (e. g., rooted directed path). We also study the particular case where each representative element is the center of its respective box. In this particular case, we provide constructive representations for interval, block and outerplanar graphs. Finally, we show that the general and the particular model are not equivalent by constructing a graph family that separates the two cases.

scholarly journals Graphs with many vertex-disjoint cycles

2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Dieter Rautenbach ◽  
Friedrich Regen
Keyword(s):  
Graph Theory ◽  
Upper Bound ◽  
Linear Time ◽  
Simple Extension ◽  
Disjoint Cycles ◽  
Cyclomatic Number ◽  
Finite Set ◽  
Extension Rule ◽  
International Audience ◽  
Vertex Disjoint

Graph Theory International audience We study graphs G in which the maximum number of vertex-disjoint cycles nu(G) is close to the cyclomatic number mu(G), which is a natural upper bound for nu(G). Our main result is the existence of a finite set P(k) of graphs for all k is an element of N-0 such that every 2-connected graph G with mu(G)-nu(G) = k arises by applying a simple extension rule to a graph in P(k). As an algorithmic consequence we describe algorithms calculating minmu(G)-nu(G), k + 1 in linear time for fixed k.

Framed 4-valent graph minor theory I: Introduction. A planarity criterion and linkless embeddability

2014 ◽  
Vol 23 (07) ◽  
pp. 1460002
Author(s):  
Vassily Olegovich Manturov
Keyword(s):  
Graph Theory ◽  
The Other ◽  
Graph Minor ◽  
Other Hand ◽  
Simple Class ◽  
Points Of View ◽  
General Graphs ◽  
Planarity Criterion

This paper is the first one in the sequence of papers about a simple class of framed 4-graphs; the goal of this paper is to collect some well-known results on planarity and to reformulate them in the language of minors. The goal of the whole sequence is to prove analogs of the Robertson–Seymour–Thomas theorems for framed 4-graphs: namely, we shall prove that many minor-closed properties are classified by finitely many excluded graphs. From many points of view, framed 4-graphs are easier to consider than general graphs; on the other hand, framed 4-graphs are closely related to many problems in graph theory.

scholarly journals On the minimum degree of the power graph of a finite cyclic group

2020 ◽  
pp. 2150044
Author(s):  
Ramesh Prasad Panda ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo
Keyword(s):  
Finite Group ◽  
Cyclic Group ◽  
Finite Groups ◽  
Minimum Degree ◽  
Simple Graph ◽  
The Other ◽  
Prime Divisors ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph [Formula: see text] of a finite group [Formula: see text] is the undirected simple graph whose vertex set is [Formula: see text], in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer [Formula: see text], let [Formula: see text] denote the cyclic group of order [Formula: see text] and let [Formula: see text] be the number of distinct prime divisors of [Formula: see text]. The minimum degree [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [R. P. Panda and K. V. Krishna, On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Comm. Algebra 46(7) (2018) 3182–3197]. For [Formula: see text], under certain conditions involving the prime divisors of [Formula: see text], we identify at most [Formula: see text] vertices such that [Formula: see text] is equal to the degree of at least one of these vertices. If [Formula: see text], or that [Formula: see text] is a product of distinct primes, we are able to identify two such vertices without any condition on the prime divisors of [Formula: see text].

scholarly journals Nordhaus–Gaddum-Type Relations for Arithmetic-Geometric Spectral Radius and Energy

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Yajing Wang ◽  
Yubin Gao
Keyword(s):  
Graph Theory ◽  
Spectral Radius ◽  
Adjacency Matrix ◽  
Upper Bounds ◽  
Simple Graph ◽  
Spectral Graph Theory ◽  
Extremal Graphs ◽  
Spectral Graph ◽  
Vertex Set

Spectral graph theory plays an important role in engineering. Let G be a simple graph of order n with vertex set V=v1,v2,…,vn. For vi∈V, the degree of the vertex vi, denoted by di, is the number of the vertices adjacent to vi. The arithmetic-geometric adjacency matrix AagG of G is defined as the n×n matrix whose i,j entry is equal to di+dj/2didj if the vertices vi and vj are adjacent and 0 otherwise. The arithmetic-geometric spectral radius and arithmetic-geometric energy of G are the spectral radius and energy of its arithmetic-geometric adjacency matrix, respectively. In this paper, some new upper bounds on arithmetic-geometric energy are obtained. In addition, we present the Nordhaus–Gaddum-type relations for arithmetic-geometric spectral radius and arithmetic-geometric energy and characterize corresponding extremal graphs.

scholarly journals Geometric classification of simple graph algebras

2012 ◽  
Vol 33 (4) ◽  
pp. 1199-1220 ◽  
Author(s):  
ADAM P. W. SØRENSEN
Keyword(s):  
Finite Type ◽  
Isomorphism Class ◽  
Simple Graph ◽  
The Other ◽  
Graph Algebras ◽  
Short List

AbstractInspired by Franks’ classification of irreducible shifts of finite type, we provide a short list of allowed moves on graphs that preserve the stable isomorphism class of the associated $C^*$-algebras. We show that if two graphs have stably isomorphic and simple unital algebras then we can use these moves to transform one into the other.

The ontology of person-centered healthcare: Theoretical essentials to reground medicine within its humanistic framework. Part I - A centered concept of personhood: Some tools to conceptualise subjectivity

2018 ◽  
Vol 6 (1) ◽  
pp. 146
Author(s):  
Thomas Frölich ◽  
F F Bevier ◽  
Alicja Babakhani ◽  
Hannah H Chisholm ◽  
Peter Henningsen ◽  
...  
Keyword(s):  
Graph Theory ◽  
Free Space ◽  
Rooted Tree ◽  
The Other ◽  
Discrete Mathematics ◽  
Soap Bubble ◽  
Soap Bubbles ◽  
In Series ◽  
The One ◽  
Individual Trees

To address subjectivity, as a generally rooted phenomenon, other ways of visualisation must be applied than in conventional objectivistic approaches. Using ‘trees’ as operational metaphors, as employed in Arthur Cayley’s ‘theory of the analytical forms called trees’, one rooted ‘tree’ must be set beneath the other and, if such ‘trees’ are combined, the resulting ‘forest’ is nevertheless made up of individual ‘trees’ and not of a deconstructed mix of ‘roots’, ‘branches’, ‘leaves’ or further categories, each understood as addressable both jointly and individually. The reasons for why we have chosen a graph theory and corresponding discrete mathematics as an approach and application are set out in this first of our three articles. It combines two approaches that, in combination, are quite uncommon and which are therefore not immediately familiar to all readers. But as simple as it is to imagine a tree, or a forest, it is equally simple to imagine a child blowing soap bubbles with the aid of a blow ring. A little more challenging, perhaps, is the additional idea of arranging such blow rings in series, transforming the size of the soap bubble in one ring after the other. To finally combine both pictures, the one of trees and the other of blow rings, goes beyond simple imagination, especially when we prolong the imagined blow ring becoming a tunnel, with a specific inner shape. The inner shape of the blow ring and its expansion as a tunnel are understood as determined by discrete qualities, each forming an internal continuity, depicted as a scale, with the scales combined in the form of a glyph plot. The different positions on these scales determine their length and if the endpoints of the spines are connected with an enveloping line then this corresponds to the free space left open in the tunnel to go through it. Using so many visualisation techniques at once is testing. Nevertheless, this is what we propose here and to facilitate such a visualisation within the imagination, we do it step by step. As the intended result of this ‘juggling of three balls’, as it were, we end up with a concept of how living beings elaborate their principal structure to enable controlled outside-inside communication.

Sign in / Sign up

Export Citation Format

Share Document