Pushpa Publishing House

Journal Menu

Content

Volume 117 (2024)

Volume 116 (2023)

Volume 111 (2021)

Volume 110 (2021)

Volume 109 (2021)

Volume 108 (2020)

Volume 107 (2020)

Volume 104 (2019)

Volume 103 (2019)

Volume 102 (2019)

Volume 101 (2019)

Volume 100 (2018)

Volume 99 (2018)

Volume 98 (2018)

Volume 97 (2017)

Volume 96 (2017)

Volume 95 (2016)

Volume 94 (2016)

Volume 93 (2015)

Volume 92 (2015)

Volume 91 (2015)

Volume 90 (2015)

Volume 89 (2014)

Volume 88 (2014)

Volume 87 (2014)

Volume 86 (2014)

Volume 85 (2013)

Volume 84 (2013)

Volume 83 (2013)

Volume 82 (2013)

Volume 81 (2013)

Volume 80 (2013)

Volume 79 (2013)

Volume 78 (2013)

Volume 77 (2013)

Volume 76 (2013)

Volume 75 (2013)

Volume 74 (2013)

Volume 73 (2012)

Volume 72 (2012)

Volume 71 (2012)

Volume 70 (2012)

Volume 69 (2012)

Volume 68 (2012)

Volume 67 (2012)

Volume 66 (2012)

Volume 65 (2012)

Volume 64 (2012)

Volume 63 (2012)

Volume 62 (2012)

Volume 61 (2011)

Volume 60 (2011)

Volume 59 (2011)

Volume 58 (2011)

Volume 57 (2011)

Volume 56 (2011)

Volume 55 (2011)

Volume 54 (2011)

Volume 53 (2011)

Volume 52 (2011)

Volume 51 (2011)

Volume 50 (2011)

Volume 49 (2010)

Volume 48 (2010)

Volume 47 (2010)

Volume 46 (2010)

Volume 45 (2010)

Volume 44 (2010)

Volume 43 (2010)

Volume 42 (2010)

Volume 41 (2010)

Volume 40 (2010)

Volume 39 (2010)

Volume 38 (2010)

Volume 37 (2009)

Volume 36 (2009)

Volume 35 (2009)

Volume 34 (2009)

Volume 33 (2008)

Volume 32 (2008)

Volume 31 (2008)

Volume 30 (2008)

Volume 29 (2007)

Volume 28 (2007)

Volume 27 (2007)

Volume 26 (2007)

Volume 25 (2006)

Volume 24 (2006)

Volume 23 (2006)

Volume 22 (2006)

Volume 21 (2005)

Volume 20 (2005)

	Volume 20, Issue 3 Pg 249 - 365 (September 2005)
	Volume 20, Issue 2 Pg 121 - 248 (August 2005)
	Volume 20, Issue 1 Pg 1 - 119 (July 2005)

Volume 19 (2005)

Volume 18 (2005)

Volume 17 (2004)

Volume 16 (2004)

Volume 15 (2004)

Volume 14 (2004)

Volume 13 (2003)

Volume 12 (2003)

Volume 11 (2003)

Volume 10 (2003)

Volume 9 (2002)

Volume 8 (2002)

Volume 7 (2002)

Volume 6 (2002)

Volume 5 (2001)

Vol. 4 (2000)

-->

Far East Journal of Applied Mathematics

H|G, if E(G) can be partitioned into subgraphs such that each subgraph is isomorphic to H. If F is a graph of minimum size for which G₁|F and G₂|F, then F is called a least common multiple of G₁ and G₂. In this paper, we find the size of a least common multiple of C₃ and P_n + K₁.

Far East Journal of Applied Mathematics
Volume 20, Issue 1, Pages 101 - 111 (July 2005)

ISOMORPHIC FACTORISATION OF GRAPHS
C. Sunil Kumar (India)

Abstract:
A graph G is said to be H-decomposable, denoted by H|G, if E(G) can be partitioned into subgraphs such that each subgraph is isomorphic to H. If F is a graph of minimum size for which G₁|F and G₂|F, then F is called a least common multiple of G₁ and G₂. In this paper, we find the size of a least common multiple of C₃ and P_n + K₁.

Keywords and phrases: decomposition, least common multiple.

Number of Downloads: 278 | Number of Views: 862

Previous Next

P-ISSN: 0972-0960

Journal Stats

Publication count: 1711

Citation count (Google Scholar): 3759

h10-index (Google Scholar): 92

h-index (Google Scholar): 24

Downloads : 378359

Views: 1482527

Downloads/publish articles: 221.13

Citations (Google Scholar)/publish articles: 2.2

This website is best viewed at 1024x768 or higher resolution with Microsoft Internet Explorer 6 or newer.