Results 271 to 280 of about 1,324,556 (299)
Some of the next articles are maybe not open access.
A Complementary Pivoting Approach to Graph Matching
2001Graph matching is a problem that pervades computer vision and pattern recognition research. During the past few decades, two radically distinct approaches have been pursued to tackle it. The first views the matching problem as one of explicit search in state-space.
MASSARO A, PELILLO, Marcello
openaire +3 more sources
On defective colourings of complementary graphs
Australas. J Comb., 1996A graph is \((m, k)\)-colourable if its vertices can be coloured with \(m\) colours such that the maximum degree of the subgraph induced on vertices receiving the same colour is at most \(k\). The \(k\)-defective chromatic number \(\chi_k(G)\) of a graph \(G\) is the least positive integer \(m\) for which \(G\) is \((m, k)\)-colourable.
Nirmala Achuthan +2 more
openaire +2 more sources
On strongly regular self ‐ complementary graphs
Journal of Graph Theory, 1981AbstractIt is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
openaire +1 more source
Transitive tournaments and self‐complementary graphs
Journal of Graph Theory, 2001AbstractA simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc.
openaire +1 more source
Parallel Graph Transformations Supported by Replicated Complementary Graphs
2011Graph transformations are the powerful formalism allowing describing a behavior of systems of various types. Parallel computations paradigm makes computations faster if we are able to reduce additional costs related to a communication overhead and a complexity of design of such systems.
Leszek Kotulski, Adam Sedziwy
openaire +1 more source
Cybernetics, 1986
The paper is mainly concerned with the class K of finite groups defined as follows: \(\Gamma\in K\) if \(\Gamma\) has an automorphism \(\sigma\) and a subset H such that \(\Gamma \setminus \{e\}=H\cup H^{\sigma}\), \(H\cap H^{\sigma}=\emptyset\) and \(h\in H\Rightarrow h^{-1}\in H\).
openaire +1 more source
The paper is mainly concerned with the class K of finite groups defined as follows: \(\Gamma\in K\) if \(\Gamma\) has an automorphism \(\sigma\) and a subset H such that \(\Gamma \setminus \{e\}=H\cup H^{\sigma}\), \(H\cap H^{\sigma}=\emptyset\) and \(h\in H\Rightarrow h^{-1}\in H\).
openaire +1 more source
Graph isomorphism and self-complementary graphs
ACM SIGACT News, 1978Marlene J. Colbourn, Charles J. Colbourn
openaire +3 more sources
Partitioning a Graph into Complementary Subgraphs
Graphs and Combinatorics, 2021Uéverton S Souza +2 more
exaly