期刊文献+
共找到14篇文章
< 1 >
每页显示 20 50 100
A Sufficient Condition of Hamilton Connected Graph
1
作者 YINZhi-xiang BAIMei 《Chinese Quarterly Journal of Mathematics》 CSCD 2003年第1期99-102,共4页
Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has |N(u)∩N(v)|≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12,... Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has |N(u)∩N(v)|≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12, then G is a Hamilton connected graph. 展开更多
关键词 DEGREE connected graph independent set
下载PDF
Note on Faudree-Schelp Theorem in Path Connected Graphs and Ore Theorem in Hamilton Connected Graphs
2
作者 ZHAOKe-wen ZENGKe-yang 《Chinese Quarterly Journal of Mathematics》 CSCD 2003年第2期175-177,共3页
In this note more short proofs are given for Faudree-Schelp theorem and Ore theorem.
关键词 Faudree-Schelp theorem Ore theorem Hamilton connected graphs
下载PDF
Solving Electrical Circuits via Graph Theory
3
作者 Jan Vrbik 《Applied Mathematics》 2022年第1期77-86,共10页
Solving for currents of an electrical circuit with resistances and batteries has always been the ultimate test of proper understanding of Kirchoff’s rules. Yet, it is hardly ever emphasized that a systematic solution... Solving for currents of an electrical circuit with resistances and batteries has always been the ultimate test of proper understanding of Kirchoff’s rules. Yet, it is hardly ever emphasized that a systematic solution of more complex cases requires good understanding of the relevant part of Graph theory. Even though this is usually not covered by Physics’ curriculum, it may still be of interest to some teachers and their mathematically inclined students, who may want to learn details of the rigorous approach. The purpose of this article is to provide a concise derivation of a linear set of equations leading to a unique solution of the problem at hand. We also present a simple computer program which builds such a solution for circuits of any textbook size. 展开更多
关键词 Kirchoff’s Laws Connected graph Incidence Matrix Spanning Tree Fundamental Cycles
下载PDF
An Alternative Proof of the Largest Number of Maximal Independent Sets in Connected Graphs Having at Most Two Cycles
4
作者 Min-Jen Jou Jenq-Jong Lin 《Open Journal of Discrete Mathematics》 2016年第4期227-237,共11页
G. C. Ying, Y. Y. Meng, B. E. Sagan, and V. R. Vatter [1] found the maximum number of maximal independent sets in connected graphs which contain at most two cycles. In this paper, we give an alternative proof to deter... G. C. Ying, Y. Y. Meng, B. E. Sagan, and V. R. Vatter [1] found the maximum number of maximal independent sets in connected graphs which contain at most two cycles. In this paper, we give an alternative proof to determine the largest number of maximal independent sets among all connected graphs of order n ≥ 12, which contain at most two cycles. We also characterize the extremal graph achieving this maximum value. 展开更多
关键词 Maximal Independent Set Connected graph Having at Most Two Cycles
下载PDF
A Computing Resource Adjustment Mechanism for Communication Protocol Processing in Centralized Radio Access Networks 被引量:3
5
作者 Guowei Zhai Lin Tian +2 位作者 Yiqing Zhou Qian Sun Jinglin Shi 《China Communications》 SCIE CSCD 2016年第12期79-89,共11页
The centralized radio access cellular network infrastructure based on centralized Super Base Station(CSBS) is a promising solution to reduce the high construction cost and energy consumption of conventional cellular n... The centralized radio access cellular network infrastructure based on centralized Super Base Station(CSBS) is a promising solution to reduce the high construction cost and energy consumption of conventional cellular networks. With CSBS, the computing resource for communication protocol processing could be managed flexibly according the protocol load to improve the resource efficiency. Since the protocol load changes frequently and may exceed the capacity of processors, load balancing is needed. However, existing load balancing mechanisms used in data centers cannot satisfy the real-time requirement of the communication protocol processing. Therefore, a new computing resource adjustment scheme is proposed for communication protocol processing in the CSBS architecture. First of all, the main principles of protocol processing resource adjustment is concluded, followed by the analysis on the processing resource outage probability that the computing resource becomes inadequate for protocol processing as load changes. Following the adjustment principles, the proposed scheme is designed to reduce the processing resource outage probability based onthe optimized connected graph which is constructed by the approximate Kruskal algorithm. Simulation re-sults show that compared with the conventional load balancing mechanisms, the proposed scheme can reduce the occurrence number of inadequate processing resource and the additional resource consumption of adjustment greatly. 展开更多
关键词 computing resource adjustment communication protocol processing cloud RAN super BS processing resource outage probability optimized connected graph
下载PDF
A Practical Parallel Algorithm for Propositional Knowledge Base Revision
6
作者 SUN WEI TAO XUEHONG and MA SHAOHAO(Dept. of Computer Science, Shandong University, Jinan 250100,P.R.China) 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期473-477,共5页
Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a rev... Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method in special case, and gives a corresponding polynomial algorithm as well as its parallel version on CREW PRAM. 展开更多
关键词 Prepositional knowledge base REVISION parallel algorithm satisfiability problem strongly connected component of a graph.
下载PDF
Distributed Nash Equilibrium Seeking on Compact Action Sets over Jointly Strongly Connected Switching Networks
7
作者 HE Xiongnan HUANG Jie 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2024年第1期63-81,共19页
This paper studies the distributed Nash equilibrium seeking(DNES)problem for games whose action sets are compact and whose network graph is switching satisfying the jointly strongly connected condition.To keep the act... This paper studies the distributed Nash equilibrium seeking(DNES)problem for games whose action sets are compact and whose network graph is switching satisfying the jointly strongly connected condition.To keep the actions of all players in their action sets all the time,one has to resort to the projected gradient-based method.Under the assumption that the unique Nash equilibrium is the unique equilibrium of the pseudogradient system,an algorithm is proposed that is able to exponentially find the Nash equilibrium.Further,the authors also consider the distributed Nash equilibrium seeking problem for games whose actions are governed by high-order integrator dynamics and belong to some compact sets.Two examples are used to illustrate the proposed approach. 展开更多
关键词 Compact action sets jointly strongly connected switching graphs Nash equilibrium seeking projected gradient-based algorithm.
原文传递
Characterization of Connected Graphs with Maximum Domination Number
8
作者 徐保根 周尚超 《Journal of Mathematical Research and Exposition》 CSCD 2000年第4期523-528,共6页
Let G be a connected graph of order p, and let γ7(G) denote the domination number of G. Clearly, γ(G) ≤[p/2]. The aim of this paper is to characterize the graphs G that reaches this upper bound. The main results ar... Let G be a connected graph of order p, and let γ7(G) denote the domination number of G. Clearly, γ(G) ≤[p/2]. The aim of this paper is to characterize the graphs G that reaches this upper bound. The main results are as follows: (1) when p is even, γ(G) = p/2 if and only if either G C4 or G is the crown of a connected graph with p/2 vertices; (2) when p is odd, γ(G) = (p-1)/2 if and only if every spanning tree of G is one of the two classes of trees shown in Theorem 3.1. 展开更多
关键词 connected graph CROWN domination number domination critical graph$
下载PDF
On the adjacent-vertex-strongly-distinguishing total coloring of graphs 被引量:79
9
作者 ZHANG ZhongFu CHENG Hui +3 位作者 YAO Bing LI JingWen CHEN XiangEn XU BaoGen 《Science China Mathematics》 SCIE 2008年第3期427-436,共10页
For any vertex u ? V(G), let T N (u) = {u} ∪ {uυ|uυ ? E(G), υ ? υ(G)} ∪ {υ ? υ(G)|uυ ? E(G) and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C f(u) = {f(x) | ... For any vertex u ? V(G), let T N (u) = {u} ∪ {uυ|uυ ? E(G), υ ? υ(G)} ∪ {υ ? υ(G)|uυ ? E(G) and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C f(u) = {f(x) | x ? T N (u)}. For any two adjacent vertices x and y of V(G) such that C f(x) ≠ C f(y), we refer to f as a k-avsdt-coloring of G (“avsdt” is the abbreviation of “ adjacent-vertex-strongly-distinguishing total”). The avsdt-coloring number of G, denoted by χast(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We prove Δ(G) + 1 ? χast(G) ? Δ(G) + 2 for any tree or unique cycle graph G. 展开更多
关键词 simple connected graph proper coloring adjacent-vertex-strongly-distinguishing total coloring 05C78 05C15
原文传递
TWO NEW SUFFICIENT CONDITIONS FOR HAMILTON-CONNECTED GRAPHS
10
作者 吴正声 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1995年第1期44-50,共7页
Let G be a 3-connected graph with n vertices, is an independent set of G} , MC(G)=min is an independent set in G}.In this paper, the main results are as follows.TheoremⅠ. If then G is Hamilton-connected.TheoremⅡ. If... Let G be a 3-connected graph with n vertices, is an independent set of G} , MC(G)=min is an independent set in G}.In this paper, the main results are as follows.TheoremⅠ. If then G is Hamilton-connected.TheoremⅡ. If, then G is Hamilton-connected.Theorems I and IIare the best possible, and are incomparable in the sense that neither theorem implies the other. 展开更多
关键词 connected graph HAMILTON-CONNECTED
原文传递
A TIGHT LOWER BOUND ON THE MAXIMUM GENUS OF 3-EDGE CONNECTED LOOPLESS GRAPHS 被引量:1
11
作者 李德明 刘彦佩 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1999年第4期361-367,共7页
It is shown that the lower bound on the maximum genus of a 3-edge connected loopless graph is at least one-third of its cycle rank. Moreover, this lower bound is tight. There are infinitely such graphs attaining the b... It is shown that the lower bound on the maximum genus of a 3-edge connected loopless graph is at least one-third of its cycle rank. Moreover, this lower bound is tight. There are infinitely such graphs attaining the bound. 展开更多
关键词 Maximum genus 3-edge connected loopless graph lower bound
全文增补中
CONSENSUS AND r-CONSENSUS PROBLEMS FOR SINGULAR SYSTEMS
12
作者 ZHANG Lequn FENG Jun-e YAO Juan 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2014年第2期252-262,共11页
In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, li... In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, linear systems with algebraic constraints are considered, and the corresponding results about consensus and average-consensus are derived. Then r-consensus and consensus problems of singular systems are investigated. Sufficient conditions of r-consensus and consensus are obtained,respectively. Finally, an illustrative example is given to show the effectiveness of the proposed method. 展开更多
关键词 Balanced graphs CONSENSUS r-consensus singular systems strong connected graphs.
原文传递
Binary sequences-based approach for construction of evolutionary network
13
作者 Rinku Mathur 《International Journal of Biomathematics》 2014年第2期13-26,共14页
Evolutionary studies have been of prime importance to life scientists since ancient times. The advancements in technology has made it possible to make available the massive amounts of genomic data. The abundance of ge... Evolutionary studies have been of prime importance to life scientists since ancient times. The advancements in technology has made it possible to make available the massive amounts of genomic data. The abundance of genomic data poses new challenges for biologists, computer scientists and mathematicians to develop approaches for discovery of new relationships in data and evolutionary networks. In this work, nucleotide sequences are converted into binary sequences to explore the network among different species. A new approach based on binary sequences has been proposed to reconstruct the accurate phylogenetic network. The algorithm developed is validated by comparing the results with those obtained by already existing method of network construction. A program is also coded in C language on the Intel Core i3 Dell inspiron machine to obtain the evolutionary network. The new approach developed also provides the fast solutions as there is no need of aligning the sequences. 展开更多
关键词 Evolutionary network binary sequences hybrid nodes Hamming distance connected graph.
原文传递
Finite-time consensus for a stochastic multi-species system
14
作者 Li Wang Qimin Zhang Yu Zhao 《International Journal of Biomathematics》 2015年第2期201-218,共18页
This paper considers the finite-time consensus problem for a stochastic multi-species system. First, we give out a nonlinear consensus protocol for the multi-species system with Brownian motion, and propose the defini... This paper considers the finite-time consensus problem for a stochastic multi-species system. First, we give out a nonlinear consensus protocol for the multi-species system with Brownian motion, and propose the definition of finite-time consensus in probability. Second, we prove that the multi-species system can achieve finite-time consensus in probability with different proper protocols by use of graph theory, stochastic Lyapunov function method and probability theory. Finally, some simulations are provided to illustrate the effectiveness of the theoretical results. 展开更多
关键词 Finite-time consensus Lyapunov function connected graph leader-following network.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部