搜索结果: 1-13 共查到“应用数学 Graph”相关记录13条 . 查询时间(0.015 秒)
PARALLEL CHIP-FIRING ON THE COMPLETE GRAPH;DEVIL’S STAIRCASE AND POINCARE ROTATION NUMBER
PARALLEL CHIP-FIRING COMPLETE GRAPH DEVIL’S STAIRCASE POINCARE ROTATION NUMBER
font style='font-size:12px;'>
2015/8/14
We study how parallel chip-firing on the complete graph Kn changes behavior as we vary the total number of chips. Surprisingly,the activity of the system, defined as the average number of firings per ...
Some new results on cordial labeling in the context of arbitrary supersubdivision of graph
Cordial graphs Supersubdivision Arbitrary supersubdivision
font style='font-size:12px;'>
2010/9/26
In this paper we discuss cordial labeling in the context of arbitrary supersubdivision of graph. We prove that the graphs obtained by arbitrary supersubdivision of path as well as star admit cordial l...
On antipodal fuzzy graph
Fuzzy relation Antipodal μ - distance regular fuzzy graph
font style='font-size:12px;'>
2010/9/26
In this paper the isometry between two fuzzy graphs is defined. Nature of the isometry relation and concepts regarding isomorphism and isometry is discussed. Antipodal fuzzy graph of the given fuzzy g...
Embedding a Forest in a Graph
Embedding Graph
font style='font-size:12px;'>
2010/11/22
For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum...
The Pachner graph and the simplification of 3-sphere triangulations
The Pachner graph 3-sphere triangulations
font style='font-size:12px;'>
2010/11/23
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangula...
Determining When The Universal Abelian Cover of a Graph Manifold is a Rationla Homology Sphere
Universal Abelian Cover Graph Rationla Homology Sphere
font style='font-size:12px;'>
2010/11/8
It was shown in my earlier article that the splice diagram of a rational homology sphere graph manifold determines the manifolds universal abelian cover. In this article we use the proof of this to g...
Maker Can Construct a Sparse Graph on a Small Board
Sparse Graph Small Board
font style='font-size:12px;'>
2010/11/15
We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Bre...
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
Optimization Framework Graph-Based Approach OFDMA Cellular Networks
font style='font-size:12px;'>
2010/11/29
This paper considers a relay-assisted bidirectional cellular network where the base station (BS)communicates with each mobile station (MS) using OFDMA for both uplink and downlink. The goal is to impr...
On harmonious colouring of line graph of central graph of paths
Central graph paths line graph and harmonious Colouring
font style='font-size:12px;'>
2010/9/10
In this paper, we present some properties of the central graph C(Pn) of a path, and its line graph [ ( n )] L C P . We mainly have our discussion on the harmonious chromatic number of C(Pn) and the li...
Fault tolerant routings in complete multipartite graph
leveled fault tolerant routing multipartite graph
font style='font-size:12px;'>
2010/9/14
The f-tolerant arc-forwarding index for a class of complete multipartite graphs are determined by constructing relevant fault tolerant routings. Furthermore, these routings are leveled for Cocktail-pa...
An efficient algorithm for graph bisection of triangularizations
Graph bisection hierarchical matrices triangularizations
font style='font-size:12px;'>
2010/9/15
Graph bisection is an elementary problem in graph theory. We consider the best known experimental algorithms and introduce a new algorithm called Longest-Path-Algorithm. Applying this algorithm to the...
On the Stabilizer of the Automorphism Group of a 4-valent Vertex-transitive Graph with Odd-prime-power Order
cayley graphs s -arc-transitive vertex-transitive
font style='font-size:12px;'>
2007/12/11
Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p~k (k ≥ 1), and let A be the full automorphism group of X. In this paper, we prove that the stabilizer Av of a vertex ...
ON THE κ-th LARGEST EIGENVALUE OF THE LAPLACIAN MATRIX OF A GRAPH
Laplacian matrix eigenvalue
font style='font-size:12px;'>
2007/12/10
In this paper,we give the upper bound and lower bound of k-th largest eigenvalue λ_κ of the Laplacian matrix of a graph G in terms of the edge number of G and the number of spanning trees of G.