Your recent article submission to Articles for Creation has been reviewed! Unfortunately, it has not been accepted at this time. The reason left by Eddie891 was:

This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources.

 The comment the reviewer left was:

This section needs sources "Let {\displaystyle G_{\phi

Please check the submission for any additional comments left by the reviewer. You are encouraged to edit the submission to address the issues raised and resubmit when they have been resolved.

• If you would like to continue working on the submission, go to Draft:Good spanning tree and click on the "Edit" tab at the top of the window.
• If you need any assistance, you can ask for help at the Articles for creation help desk or on the reviewer's talk page.
• You can also use Wikipedia's real-time chat help from experienced editors.

G_\phi be a plane graph. Let {\displaystyle T} T be a rooted spanning tree of {\displaystyle G_{\phi }} G_\phi. Let {\displaystyle P(r,v)=(r=u_{1}),u_{2},\ldots ,(v=u_{k})} {\displaystyle P(r,v)=(r=u_{1}),u_{2},\ldots ,(v=u_{k})} be the path in {\displaystyle T} T from the root {\displaystyle r} r to a vertex {\displaystyle v\neq r} {\displaystyle v\neq r}. The path {\displaystyle P(r,v)} {\displaystyle P(r,v)} divides the children of {\displaystyle u_{i}} u_{i}, {\displaystyle (1\leq i<k)} {\displaystyle (1\leq i<k)}, except {\displaystyle u_{i+1}} {\displaystyle u_{i+1}}, into two groups; the left group {\displaystyle L} L and the right group {\displaystyle R} R. A child {\displaystyle x} x of {\displaystyle u_{i}} u_{i} is in group {\displaystyle L} L and denoted by {\displaystyle u_{i}^{L}} {\displaystyle u_{i}^{L}} if the edge {\displaystyle (u_{i},x)} {\displaystyle (u_{i},x)} appears before the edge {\displaystyle (u_{i},u_{i+1})} {\displaystyle (u_{i},u_{i+1})} in clockwise ordering of the edges incident to {\displaystyle u_{i}} u_{i} when the ordering is started from the edge {\displaystyle (u_{i},u_{i+1})} {\displaystyle (u_{i},u_{i+1})}. Similarly, a child {\displaystyle x} x of {\displaystyle u_{i}} u_{i} is in the group {\displaystyle R} R and denoted by {\displaystyle u_{i}^{R}} {\displaystyle u_{i}^{R}} if the edge {\displaystyle (u_{i},x)} {\displaystyle (u_{i},x)} appears after the edge {\displaystyle (u_{i},u_{i+1})} {\displaystyle (u_{i},u_{i+1})} in clockwise order of the edges incident to {\displaystyle u_{i}} u_{i} when the ordering is started from the edge {\displaystyle (u_{i},u_{i+1})} {\displaystyle (u_{i},u_{i+1})}. We call {\displaystyle T} T a good spanning tree of {\displaystyle G_{\phi }} G_\phi if every vertex {\displaystyle v} v {\displaystyle (v\neq r)} {\displaystyle (v\neq r)} of {\displaystyle G_{\phi }} G_\phi satisfies the following two conditions with respect to {\displaystyle P(r,v)} {\displaystyle P(r,v)}.

[Cond1] {\displaystyle G_{\phi }} G_\phi does not have a non-tree edge {\displaystyle (v,u_{i})} {\displaystyle (v,u_{i})}, {\displaystyle i<k} {\displaystyle i<k}; and [Cond2] the edges of {\displaystyle G_{\phi }} G_\phi incident to the vertex {\displaystyle v} v excluding {\displaystyle (u_{k-1},v)} {\displaystyle (u_{k-1},v)} can be partitioned into three disjoint (possibly empty) sets {\displaystyle X_{v},Y_{v}} {\displaystyle X_{v},Y_{v}} and {\displaystyle Z_{v}} {\displaystyle Z_{v}} satisfying the following conditions (a)-(c) (a) Each of {\displaystyle X_{v}} {\displaystyle X_{v}} and {\displaystyle Z_{v}} {\displaystyle Z_{v}} is a set of consecutive non-tree edges and {\displaystyle Y_{v}} {\displaystyle Y_{v}} is a set of consecutive tree edges. (b) Edges of set {\displaystyle X_{v}} {\displaystyle X_{v}}, {\displaystyle Y_{v}} {\displaystyle Y_{v}} and {\displaystyle Z_{v}} {\displaystyle Z_{v}} appear clockwise in this order from the edge {\displaystyle (u_{k-1},v)} {\displaystyle (u_{k-1},v)}. (c) For each edge {\displaystyle (v,v')\in X_{v}} {\displaystyle (v,v')\in X_{v}}, {\displaystyle v'} v' is contained in {\displaystyle T_{u_{i}^{L}}} {\displaystyle T_{u_{i}^{L}}}, {\displaystyle i<k} {\displaystyle i<k}, and for each edge {\displaystyle (v,v')\in Z_{v}} {\displaystyle (v,v')\in Z_{v}}, {\displaystyle v'} v' is contained in {\displaystyle T_{u_{i}^{R}}} {\displaystyle T_{u_{i}^{R}}}, {\displaystyle i<k} {\displaystyle i<k}."|sig=yes}}

Hello! Funwithgraph, I noticed your article was declined at Articles for Creation, and that can be disappointing. If you are wondering why your article submission was declined, please post a question at the Articles for creation help desk. If you have any other questions about your editing experience, we'd love to help you at the Teahouse, a friendly space on Wikipedia where experienced editors lend a hand to help new editors like yourself! See you there! Eddie891 (talk) 11:21, 18 June 2017 (UTC)Reply

Your recent article submission to Articles for Creation has been reviewed! Unfortunately, it has not been accepted at this time. The reason left by DrStrauss was:

This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources.

 The comment the reviewer left was:

More are needed to prevent any accusations of WP:NOR.

Please check the submission for any additional comments left by the reviewer. You are encouraged to edit the submission to address the issues raised and resubmit when they have been resolved.

• If you would like to continue working on the submission, go to Draft:Good spanning tree and click on the "Edit" tab at the top of the window.
• If you need any assistance, you can ask for help at the Articles for creation help desk or on the reviewer's talk page.
• You can also use Wikipedia's real-time chat help from experienced editors.

DrStrauss talk 12:30, 3 July 2017 (UTC)Reply

Good spanning tree, which you submitted to Articles for creation, has been created.
The article has been assessed as Start-Class, which is recorded on the article's talk page. You may like to take a look at the grading scheme to see how you can improve the article.

You are more than welcome to continue making quality contributions to Wikipedia. Note that because you are a logged-in user, you can create articles yourself, and don't have to post a request. However, you may continue submitting work to Articles for Creation if you prefer.

• If you have any questions, you are welcome to ask at the help desk.
• If you would like to help us improve this process, please consider leaving us some feedback.

Thank you for helping improve Wikipedia!

SwisterTwister talk 05:14, 14 July 2017 (UTC)Reply

The article Md. Saidur Rahman has been proposed for deletion because it appears to have no references. Under Wikipedia policy, this biography of a living person will be deleted after seven days unless it has at least one reference to a reliable source that directly supports material in the article.

If you created the article, please don't be offended. Instead, consider improving the article. For help on inserting references, see Referencing for beginners, or ask at the help desk. Once you have provided at least one reliable source, you may remove the {{prod blp/dated}} tag. Please do not remove the tag unless the article is sourced. If you cannot provide such a source within seven days, the article may be deleted, but you can request that it be undeleted when you are ready to add one. reddogsix (talk) 23:34, 2 May 2018 (UTC)Reply

A tag has been placed on Md. Saidur Rahman requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a real person or group of people, but it does not credibly indicate how or why the subject is important or significant: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, such articles may be deleted at any time. Please read more about what is generally accepted as notable.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be deleted without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines. If the page is deleted, and you wish to retrieve the deleted material for future reference or improvement, then please contact the deleting administrator. reddogsix (talk) 23:35, 2 May 2018 (UTC)Reply