Flower Snark Graphs

Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Can someone give me some advice on our paper entitled "On the minimum edge deletion of a flower snark graph" ? We Aim to determine the minimum edges whose deletion results in a disconnected subgraph of a flower snark graph. We want to generalize the minimum edge deletion to all flower snark graph. Hope to read this and gain some knowledge to all, God bless everyone
graph-theory
add a comment |Â
up vote
0
down vote
favorite
Can someone give me some advice on our paper entitled "On the minimum edge deletion of a flower snark graph" ? We Aim to determine the minimum edges whose deletion results in a disconnected subgraph of a flower snark graph. We want to generalize the minimum edge deletion to all flower snark graph. Hope to read this and gain some knowledge to all, God bless everyone
graph-theory
1
Your request ("give me some advice") isn't narrow enough to make a good Question for Math.SE. If you wrote a paper on this, perhaps some specific problems emerged that you want to post for help with solving, but you should undertake to give a reasonably self-contained presentation of such a problem. Throwing open the discussion with very little guidance on the topic is not the way Math.SE can best help with your studies. See the tour and ask reasonably scoped Questions.
â hardmath
Aug 16 at 1:47
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Can someone give me some advice on our paper entitled "On the minimum edge deletion of a flower snark graph" ? We Aim to determine the minimum edges whose deletion results in a disconnected subgraph of a flower snark graph. We want to generalize the minimum edge deletion to all flower snark graph. Hope to read this and gain some knowledge to all, God bless everyone
graph-theory
Can someone give me some advice on our paper entitled "On the minimum edge deletion of a flower snark graph" ? We Aim to determine the minimum edges whose deletion results in a disconnected subgraph of a flower snark graph. We want to generalize the minimum edge deletion to all flower snark graph. Hope to read this and gain some knowledge to all, God bless everyone
graph-theory
asked Aug 16 at 1:31
John Leo Caraig
11
11
1
Your request ("give me some advice") isn't narrow enough to make a good Question for Math.SE. If you wrote a paper on this, perhaps some specific problems emerged that you want to post for help with solving, but you should undertake to give a reasonably self-contained presentation of such a problem. Throwing open the discussion with very little guidance on the topic is not the way Math.SE can best help with your studies. See the tour and ask reasonably scoped Questions.
â hardmath
Aug 16 at 1:47
add a comment |Â
1
Your request ("give me some advice") isn't narrow enough to make a good Question for Math.SE. If you wrote a paper on this, perhaps some specific problems emerged that you want to post for help with solving, but you should undertake to give a reasonably self-contained presentation of such a problem. Throwing open the discussion with very little guidance on the topic is not the way Math.SE can best help with your studies. See the tour and ask reasonably scoped Questions.
â hardmath
Aug 16 at 1:47
1
1
Your request ("give me some advice") isn't narrow enough to make a good Question for Math.SE. If you wrote a paper on this, perhaps some specific problems emerged that you want to post for help with solving, but you should undertake to give a reasonably self-contained presentation of such a problem. Throwing open the discussion with very little guidance on the topic is not the way Math.SE can best help with your studies. See the tour and ask reasonably scoped Questions.
â hardmath
Aug 16 at 1:47
Your request ("give me some advice") isn't narrow enough to make a good Question for Math.SE. If you wrote a paper on this, perhaps some specific problems emerged that you want to post for help with solving, but you should undertake to give a reasonably self-contained presentation of such a problem. Throwing open the discussion with very little guidance on the topic is not the way Math.SE can best help with your studies. See the tour and ask reasonably scoped Questions.
â hardmath
Aug 16 at 1:47
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2884287%2fflower-snark-graphs%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
1
Your request ("give me some advice") isn't narrow enough to make a good Question for Math.SE. If you wrote a paper on this, perhaps some specific problems emerged that you want to post for help with solving, but you should undertake to give a reasonably self-contained presentation of such a problem. Throwing open the discussion with very little guidance on the topic is not the way Math.SE can best help with your studies. See the tour and ask reasonably scoped Questions.
â hardmath
Aug 16 at 1:47