graphlinear complexitylower boundupper boundSummary This chapter deals with the measurement of graph complexity by focusing on the adjacency matrix of the graph, and the linear complexity of the matrix. The firs
We then compute or give upper bounds for the linear complexity of several classes of graphs.doi:10.1002/9783527670468.ch06David L. NeelMichael E. OrrisonWiley‐VCH Verlag GmbH & Co. KGaAD.L. Neel, M.E. Orrison, The Linear Complexity of a Graph, The Electronic Journal of Combinatorics, ...
The structural information content (Rashevsky, 1955; Trucco 1956a, b)Ig(X)of a graphXis defined as the entropy of the finite probability scheme constructed from the orbits of its automorphism groupG(X). The behavior ofIgon various graph operations—complement, sum, join, cartesian product an...
Reingold The complexity of a pursuit on a graph Computer Science Department, University of Illinois Technical Report UIUCDCS-R-92-1754 (1992) Google Scholar [16] R.K. Guy Unsolved problems in combinatorial games R.K. Guy (Ed.), Combinatorial Games, Proceedings of Symposia in Applied ...
In the first part of this work we study the following question: Given two \\\(k\\\) -colorings \\\(\\\alpha \\\) and \\\(\\\beta \\\) of a graph \\\(G\\\) on \\\(n\\\) vertices and an integer \\\(\\\ell \\\) , can \\\(\\\alpha \\\) be modified into ...
The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept... X Li,Y Mao - 《Computer Science》 被引量: 26发表: 2012年 APAC: An exact algorithm for retrieving cycles and paths in all...
Graph Matching ProblemThis paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining Techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the ...
We study homomorphism problems of signed graphs from a computational point of view. A signed graph is a graph where each edge is given a sign, positive or negative; denotes the set of negative edges. Thus, is a -edge-coloured graph with the property that the edge-colours, , form a grou...
Assuming that both players play optimally, the game domination number γg(G) of a graph G denotes the number of moves played in D-Game, and the Staller-start game domination number γg′(G) the number of moves played in S-Game. Giving a formula for the exact value of γg(G) and ...
The detail was astonishing, like the circuits on a computer chip —James Morrow (By marriage she had to assume a whole new family of blood kin) elaborate as a graph —George Garrett (Their relationship seemed as) intricate as a DNA blueprint —Joseph Wambaugh ...