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 ...
This is top 10, for more click Top 100 Stars in Perl RankingProject NameStarsForksLanguageOpen IssuesDescriptionLast Commit 1 cloc 20325 1044 Perl 26 cloc counts blank lines, comment lines, and physical lines of source code in many programming languages. 2025-02-28T18:40:29Z 2 FlameGraph 17...
The (n,k)-star graph is a generalized version of the n-star graph. The two parameters n and k can be tuned to make a suitable choice for the number of nodes in the network and for the degree/diameter tradeoff. This allows more flexibility in designing network topology than the star ...
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...
J. Graph Theory, 43 (2003), pp. 137-149 View in ScopusGoogle Scholar [3] F.K. Bell, P. Rowlinson On the multiplicities of graph eigenvalues Bull. London Math. Soc., 35 (2003), pp. 401-408 View in ScopusGoogle Scholar [4] D. Cvetković, M. Doob, H. Sachs Spectra of Graphs...
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...
If you crave for intellectual challenge in mathematics, you are always welcome to check out my Graph Theory repository. Nevertheless, I believe the birth of this project will meet your picky demand. Buon appetito 😋 🍊 🍍 🍈 🌽 and 🍠 are something we have been taking for granted....
These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph. 展开 关键词: interconnection network fault tolerance largest connected component star graph ...
Summary: The Ramsey number for a graph $G$ versus a graph $H$, denoted by $R(G,H)$, is the smallest positive integer $n$ such that for any graph $F$ of ord... Hasmawati,H Assiyatun,ET Baskoro,... - Computational Geometry & Graph Theory-international Conference 被引量: 7发表:...
In this case, we will show that there is no general restriction on c2. If one assumes c2≠0, then the induced subgraph Γ(S)c∗ is itself a zero-divisor graph of some zero-divisor semigroup. Another fact is that if we use Cn (Kn, Pn, respectively) to denote the cycle graph (...