The Maximum Edge-Edge Connectivity of Quasi-Regular Graphs

The edge-edge connectivity of a graph is defined,and a class of quasi-regulargraphs is proposed with a maximum edge-edge connectivity.     

MATRIC EXPRESSIONS OF GRACEFUL GRAPH AND HARMONIC GRAPH

This paper introduces new concepts of graceful matrix and har-monic matrix,and proves that a graph is graceful or harmonic iff there exists agraceful or harmonic matrix which is a P-adjacent matrix of a graph.This paperalso introduces a new concept of harmonic interlaced graph,and proves that agraph is interlaced iff it is also harmonic interlaced.     

The Harmony of Cap- tassels Graph M(2m+ 1,t,G)

This paper propored a concept of cap- tassels graph and illustrated that M(2m+ 1,t,G) is harmonious when n=2m+ 1 and G is strong harmonious.     

THE SIEVE GRAPH S(2m+1, t) IS HARMONIOUS

Since Graham R. L. and Sloan N. J. A. advanced the concept of the harmonious graph in 1980. Many such researching papers are published. This paper constructs a class of the graph-sieve graph S(n,t),and proves that the sieve graph S(2m+1,t) is harmonious when n=2m+1.     

Database Queries of Drawing''s Associated Information and Its Application

AutoCAD is a plotting tool familiarized and often used. If the database information associated with the graph can be directly found in AutoCAD, It will not only save cost when the user does not purchase softwares such as Mapinfo,Automap etc., but also lighten the user's learning burden. This method has been realized by using ActiveX Automation technique and VB6.0. Firstly, a selection set of current entity graph is constructed to form a block, and the block is named by the associated searching keyword. Secondly,when searching database information associated with the graph, users can click this block and get this block name and the searching result will be displayed by using the block name as the searching keyword. The above implementation method is discussed and some key source codes is given in this paper. A application example to search the devices information in power supply departments' hookup is also given.     

Modeling by Bond Graph and Simulation for a Metal Pushing Belt Continuously Variable Transmission System

Continuously variable transmission is the ideal transmission mode, the Metal Pushing Continuously Variable Transmission (CVT) is the most mature CVT used in vehicle at present. By studying the transmission mechanism and ratio change characteristics of Metal Pushing Continuously Variable Transmission system, and using the bond graph theory, a bond graph model of continuously variable transmission is established in this paper, and the state space function is derived. Based on the model, The simulation of transmission characteristics of a CVT car is studied, the simulation result shows that the dynamic characteristics of continuously variable transmission could be expressed in this model. The research results can provide the theoretical analysis method and design basis for CVT vehicle.[WT5HZ]     

Analysis of Reliability of the Harary Graph

When the vertices fail independently with each other by a constant probability,the reliability of a sraph is defined to be the probability that the graph results from deleting thefailed venices together with the incidence edges is connected. The Harary graph,a class of graphswith the best connectivity is considered in this paper,the bound of it's reliability is obtained,and theasymptotic property of reliability is also analysed.     

Image denoising based on adaptive graph regularization

Adaptive regularization can select different parameters based on the features of local areas in an image, which can differentiate the edges and noise in an image flexibly. An adaptive graph regularization is proposed based on graph spectral theory and adaptive regularization, which uses the Non local means to generate the weighting function of graph. The adaptive graph regularization equation is used to filter the noisy image. Simulation results show that the proposed method can effectively remove the noise and is superior to other graph theory based partial differential equation methods.     

Power Model of Bond Graph and Dynamic Simulation of Hoist System for Multi-Flow Transmission

The double drive hoist reducer developed in the planetary gear is a new generation of energy saving and environment protecting hoist product. The multi flow transmission system theory of hoist is analyzed. With the theory and method of bond graph,a bond graph model with coupled vibration is established for hoist multi flow transmission system for the first time. The state equation of the system is developed and dynamic simulation analysis is also carried out. The internal changing law and relationship of the system for the state variable are got. Therefore, the dynamic properties and gearing features of this system are revealed comprehensively. The research results can provide the dynamic analysis method and design basis for multi flow transmission system of hoist.     

A SFG METHOD FOR RELIABILITY EVALUATION OF HVDC SYSTEMS

Steady-state probability, frequency and duration are the three main indices in reliability evaluation of the HVDC systems. Generally, they are solved by numerical methods. Their topolgical formulaes are derived by using the basic theory of ccates graph and considering conditions for some particularity of state-space in this paper. A set of generalised formulaes can be applied to obtain these indices expression about reliability parameters of components. Finally,an example is given to illustrate and verify this method.     

Scanning Beam Method for the Contour Graph

The tracing method is applied to generate the contour graph, it is difficult to find the start point of the interior closed contour beam. This paper presents a general scanning beam method which can be applied to generate color contour graph for elements with arbitrary shape by the object-oriented programming. We give visualization of the elements of triangle the element with 3 Points, triangle element with 6 Points, quadrilateral element with 4 Points, quadrilateral element with 8 Points, quadrilateral Element with 9 Points and the example by the MFC of Visual C++ R6.     

THE SUFFICIENT AND NECESSARY CONDITION FOR A PLANAR TO BE HAMILTONIAN

This paper presents a sufficient and necessary condition for any planarembedding G(namely plane graph)of a planar graph to be Hamiltonian.If Gis Hamiltonian,a method that an adjacent edge subgraph method for finddingits Hamilton cycles are given.     

A METHOD OF GENERATING ACTIVE TREE TERMS USING THE "IMPROVED W-ALGEBRAIC METHOD

By defining an operator"M", the paper has applied the improved Walgebraic method to the directed graph. The developed theory does not make non-tree combination type terms and can eliminate a large part of cancellations terms caused by. the active elements or .transformers. The paper has solved the retrogration problem for algorithm of W-algebraic method while used in the directed graph.     

A Class of Hypergraphs with the Best Connectivity

A jumping sequence is proposed,so that a class of r-uniform hypergraphs with nvenices and n edges is constructed. Then by analysing the connectivity of its two-section (graph),this class of hypergraphs is proved to have the best connectivity. The class of hypergraphs can beused to desisn the optimal fault-tolerant multibus computer systems.     

Designing and Realization of Leak Current Fault Flatroof for Lauch Vihicle Controlling System

A visualized analysis system of leak current fault transmission graph is developed. Its functions, program structure and programming principle are described.The system is composed of fault diagnosing module and man machine exchanging module, which make the generation and analysis of leak current fault transmission graph for lauch vehicle controlling system simple and visualized. The system could automatically recognize the picture of transmission and analyze both qualitatively and quantitatively only by drawing it on the monitor by the mouse. Finally an example is given, where a satisfying result is acquired via drawing inputting method which is totally new and expanding-complementing the fault tree alglorithm.     

星座图在棉花品种数量分类中的应用初探

本文探讨了星座图在棉花品种数量分类中的应用效果。结果表明,星座图是一种清晰简洁而又有效的数量分类方法。应用星座图分类法的关键是正确确定分类指标的权重。     

THE APPLICATIONS OF GRAPH THEORY IN STRUCTURE MECHANICS

This paper presents some ideas of graph theory which are led int(?) structural matrix analysis. The main contents of this paper are the principal points of the graph theory, the computative principles of the node method and the mesh method.     

低温谷物干燥计算机模拟中的可视化

运用计算机图形技术进行了低温谷物干燥计算机模拟可视化研究，从计算机生成图象中可及时，直观地观察了到低温物干燥过程中的有关现象和规律，而无需冗繁的数据处理。     

Graph clustering of Piper nigrum L. (black pepper)

A profound degree of morphological variation exists among the cultivars of Piper nigrum cultivated in Kerala State, South India. Fifty one cultivars of this crop species from the State were subjected to graph clustering by the ‘Graph Theory’ model, based on 27 morphological characters, both qualitative and quantitative, aimed at clustering them into groups with an appreciable degree of intracluster discreteness and intercluster distance. The result was presented in a ‘Skyline Plot’. Ten C-clusters were formed at the c-value of 0.46 corresponding to a fairly high moat value. The number of members from different clusters ranged from 3–8. Distribution of various characters among the clusters formed, shows a considerable degree of intracluster similarity (connectedness) and intercluster distance (isolation). The present graph clustering is significant as it provides reliable clues for selecting parental cultivars with fair degree of genetic difference, from clusters exhibiting appreciable isolation, for future intervarietal hybridization programmes in the crop. This revised version was published online in July 2006 with corrections to the Cover Date.