FABREGA J ;FOIL M A.On the extraconnectivity of graphs.Discrete Mathematics.1996.49-57FaFi96b] J. F`abrega and M.A. Fiol, On the extraconnectivity of graphs. Discrete Math. 155 (1996), 49-57.J. Fabrega,M.A. Fiol.On the extraconnectivity of graphs.Discrete Mathematics. 1996...
Connectivity Local connectivity Minimum degree Diamond-free graph p-diamond-free graph 1. Terminology and introduction We consider finite graphs without loops and multiple edges. The vertex set and edge set of a graph G are denoted by V(G) and E(G), respectively. For a vertex v∈V(G), ...
On the generalized (edge-)connectivity of graphs Xueliang Li,Yaping Mao,Yuefang Sun Full-Text Cite this paper Add to My Lib Abstract: The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept...
Therefore, knowledge distillation on graphs (KDG), which naturally introduces the advantages of KD into graph learning and builds efficient GNNs, has become a promising research topic and attracted increasing attention from the Artificial Intelligence (AI) community. Consequently, there have been many K...
CiteSeerX - Scientific documents that cite the following paper: On some connectivity properties of Eulerian graphsdoi:10.1007/BF01902503L. LovászKluwer Academic PublishersActa Mathematica Academiae Scientiarum HungaricaeL. Lovász, On some connectivity properties of Eulerian graphs, Acta. Math. Acad. Sci...
graphsexpanderconnectivityspace空间连通ustcon OnexpandergraphsandconnectivityinsmallspaceOmerReingold∗Abstract.Thispresentationisaimedtocommunicatearecentlyfounddeterministicalgorithmfordeterminingconnectivityinundirectedgraphs[40].Thisalgorithmusestheminimalamountofmemorypossible,uptoaconstantfactor.Specifically,thealgorithm...
Graphs are ubiquitous in encoding relational information of real-world objects in many domains. Graph generation, whose purpose is to generate new graphs from a distribution similar to the observed graphs, has received increasing attention thanks to the recent advances of deep learning models. In thi...
The main aim of this paper is to establish conditions that are necessary and sufficient for the edge-connectivity of the Cartesian product of two graphs to equal the sum of the edge-connectivities of the factors. The paper also clarifies an issue that has arisen in the literature on Cartesian...
Furthermore, the relationship between super point-connectivity and super edge-connectivity on the Cartesian product of graphs is pointed out. Introduction A graph G=(V,E) is maximum edge-connected (in short, max-λ) if λ=[2q/p], where p=|V|,q=|E| and λ=λ(G) is the edge-...
The betweenness centrality of a vertex of a graph is the portion of the shortest paths between all pairs of vertices passing through a given vertex. We study upper bounds for this invariant and its relations to the diameter and average distance of a grap