Graph representationsPlanar chirality of objects is a problem with important applications in many fields of natural sciences, especially in chemistry and pharmacology. The analysis of chirality properties can be studied using n -polyominoes and planar graphs. In this paper we show that graph ...
In graph theory, a star Sk is the complete bipartite graph K1,k, a tree with one internal node and k leaves. A star with 3 edges is called a claw. The star Sk is edge-graceful when k is even and not when k is odd. It is edge-transitive, unit distance and has diameter 2, ...
This is top 10, for more click Top 100 Stars in Perl RankingProject NameStarsForksLanguageOpen IssuesDescriptionLast Commit 1 cloc 20163 1037 Perl 23 cloc counts blank lines, comment lines, and physical lines of source code in many programming languages. 2025-02-02T01:21:34Z 2 FlameGraph 17...
展开 关键词: graph theory peer-to-peer computing probability telecommunication network topology PeerStar disconnection probability graph-theoretic model inter-peer communication maximum connectivity network scalability 会议名称: IEEE Symposium on Computers & Communications 会议时间: 2009 主办...
The reliability of the Star Graph architecture is discussed. The robustness of the Star Graph network under node failures, link failures, and combined node and link failures is shown. The degradation of the Star Graph into Substar Graphs is used as the measure of system effectiveness in the fa...
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by γ pr(G), is the minimum cardinality of a paired-do...
Li, Y., Rousseau, C.C.: Fan-complete graph Ramsey numbers. J. Graph Theory 23, 413–420 (1996) Article MathSciNet Google Scholar Liu, M., Li, Y.: Ramsey numbers of a fixed odd-cycle and generalized fans and books. Discrete Math. 339, 2481–2489 (2016) Article MathSciNet Google...
Combin. Theory Ser. B, in press. Google Scholar 10. W.-L. Hsu, Decompositions of perfect graphs, a manuscript. Google Scholar 11. L Lovász Normal hypergraphs and the perfect graph conjecture Discrete Math., 2 (1972), pp. 253-267 View PDFView articleView in ScopusGoogle Scholar 12. H...
We examine some topological properties of the(n,k)-star graph from the graph-theory point of view. It isshown that two different types of edges in the (n,k)-star prevent itfrom being edge-symmetric, but edges in each class are essentiallysymmetric with respect to each other. Also, the ...
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the grooming factor) paths of the same color can share an edge. Each path uses an ADM at each of its endp...