How should I call a graph that is not a multigraph?

up vote
1
down vote

favorite

Vocabulary question :
A multigraph is a graph that can have several identical edges (same vertices, same direction if directed).

Is there an official name for a graph that is not a multigraph ?

• "Graph" seems too generic, as this describes any kind of graph


• "Simple graph" is already an undirected "not multi" graph with no loops

I didn't manage to find better names for a graph which only constraint would be "no identical edges"... "Monograph" ?

graph-theory

share|cite|improve this question

edited 1 hour ago

asked 2 hours ago

xlecoustillier

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

• 
  
  
  

  
  

  
  
  
  
  
  

  
  Well as you state, a "simple graph" is not a multigraph... you should probably state what kind of graph you're looking for, because there's plenty graphs "not a multigraph". In fact, as far as I know, "simple graph" does capture all graphs that are not a multigraph. There's nothing about direction in either of their definitions.
  – vrugtehagel
  2 hours ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel I'm simply looking for a generic name for a graph that has no other constraint than "no identical edges". It could be either directed or undirected, have loops or not, doesn't matter. All the other "not a multigraph" names I found have more constraints than just this one.
  – xlecoustillier
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  Then I think "simple graph" is indeed exactly what you're looking for. Unless you want loops. Then you could probably say "simple graph with loops" (as I don't think there's a name for that). Also, simple graphs are undirected, yes, but so are multigraphs. If you want it to be directed, then just say "directed simple graph". The world of graphs is already too full of definitions, let's not add another term to the book ;) of course, if you're writing an article or paper, define it yourself, and that should be perfectly fine.
  – vrugtehagel
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel Hence my question. If the answer is "there's no name for that", then fine, and that would explain why I didn't find any :) As an aside, Wikipedia disagrees with you regarding the "undirectedness" of multigraphs (ok then it's called a multidigraph, which underlines what you said about graph theory definition bloating...).
  – xlecoustillier
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  The problem with this kind of question if the answer doesn't exist, is, nobody can definitively say it doesn't exist. I personally don't know it, but that doesn't mean it doesn't exist - the same goes for everyone else that doesn't know it. In this case, I'd say, "it doesn't exist". As I said, if you really need a name for it, define it yourself. If you were just interested to find out the name, then I'm sorry, I can't help you further.
  – vrugtehagel
  1 hour ago
  

  
  
  
  

 | 
show 2 more comments

up vote
1
down vote

favorite

Vocabulary question :
A multigraph is a graph that can have several identical edges (same vertices, same direction if directed).

Is there an official name for a graph that is not a multigraph ?

• "Graph" seems too generic, as this describes any kind of graph


• "Simple graph" is already an undirected "not multi" graph with no loops

I didn't manage to find better names for a graph which only constraint would be "no identical edges"... "Monograph" ?

graph-theory

share|cite|improve this question

edited 1 hour ago

asked 2 hours ago

xlecoustillier

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

• 
  
  
  

  
  

  
  
  
  
  
  

  
  Well as you state, a "simple graph" is not a multigraph... you should probably state what kind of graph you're looking for, because there's plenty graphs "not a multigraph". In fact, as far as I know, "simple graph" does capture all graphs that are not a multigraph. There's nothing about direction in either of their definitions.
  – vrugtehagel
  2 hours ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel I'm simply looking for a generic name for a graph that has no other constraint than "no identical edges". It could be either directed or undirected, have loops or not, doesn't matter. All the other "not a multigraph" names I found have more constraints than just this one.
  – xlecoustillier
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  Then I think "simple graph" is indeed exactly what you're looking for. Unless you want loops. Then you could probably say "simple graph with loops" (as I don't think there's a name for that). Also, simple graphs are undirected, yes, but so are multigraphs. If you want it to be directed, then just say "directed simple graph". The world of graphs is already too full of definitions, let's not add another term to the book ;) of course, if you're writing an article or paper, define it yourself, and that should be perfectly fine.
  – vrugtehagel
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel Hence my question. If the answer is "there's no name for that", then fine, and that would explain why I didn't find any :) As an aside, Wikipedia disagrees with you regarding the "undirectedness" of multigraphs (ok then it's called a multidigraph, which underlines what you said about graph theory definition bloating...).
  – xlecoustillier
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  The problem with this kind of question if the answer doesn't exist, is, nobody can definitively say it doesn't exist. I personally don't know it, but that doesn't mean it doesn't exist - the same goes for everyone else that doesn't know it. In this case, I'd say, "it doesn't exist". As I said, if you really need a name for it, define it yourself. If you were just interested to find out the name, then I'm sorry, I can't help you further.
  – vrugtehagel
  1 hour ago
  

  
  
  
  

 | 
show 2 more comments

up vote
1
down vote

favorite

up vote
1
down vote

favorite

Vocabulary question :
A multigraph is a graph that can have several identical edges (same vertices, same direction if directed).

Is there an official name for a graph that is not a multigraph ?

• "Graph" seems too generic, as this describes any kind of graph


• "Simple graph" is already an undirected "not multi" graph with no loops

I didn't manage to find better names for a graph which only constraint would be "no identical edges"... "Monograph" ?

graph-theory

share|cite|improve this question

edited 1 hour ago

asked 2 hours ago

xlecoustillier

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

Vocabulary question :
A multigraph is a graph that can have several identical edges (same vertices, same direction if directed).

Is there an official name for a graph that is not a multigraph ?

• "Graph" seems too generic, as this describes any kind of graph


• "Simple graph" is already an undirected "not multi" graph with no loops

I didn't manage to find better names for a graph which only constraint would be "no identical edges"... "Monograph" ?

graph-theory

graph-theory

share|cite|improve this question

edited 1 hour ago

asked 2 hours ago

xlecoustillier

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

edited 1 hour ago

asked 2 hours ago

xlecoustillier

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

share|cite|improve this question

edited 1 hour ago

edited 1 hour ago

edited 1 hour ago

asked 2 hours ago

xlecoustillier

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 2 hours ago

xlecoustillier

1063

asked 2 hours ago

xlecoustillier

1063

1063

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

New contributor

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

xlecoustillier is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

• 
  
  
  

  
  

  
  
  
  
  
  

  
  Well as you state, a "simple graph" is not a multigraph... you should probably state what kind of graph you're looking for, because there's plenty graphs "not a multigraph". In fact, as far as I know, "simple graph" does capture all graphs that are not a multigraph. There's nothing about direction in either of their definitions.
  – vrugtehagel
  2 hours ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel I'm simply looking for a generic name for a graph that has no other constraint than "no identical edges". It could be either directed or undirected, have loops or not, doesn't matter. All the other "not a multigraph" names I found have more constraints than just this one.
  – xlecoustillier
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  Then I think "simple graph" is indeed exactly what you're looking for. Unless you want loops. Then you could probably say "simple graph with loops" (as I don't think there's a name for that). Also, simple graphs are undirected, yes, but so are multigraphs. If you want it to be directed, then just say "directed simple graph". The world of graphs is already too full of definitions, let's not add another term to the book ;) of course, if you're writing an article or paper, define it yourself, and that should be perfectly fine.
  – vrugtehagel
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel Hence my question. If the answer is "there's no name for that", then fine, and that would explain why I didn't find any :) As an aside, Wikipedia disagrees with you regarding the "undirectedness" of multigraphs (ok then it's called a multidigraph, which underlines what you said about graph theory definition bloating...).
  – xlecoustillier
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  The problem with this kind of question if the answer doesn't exist, is, nobody can definitively say it doesn't exist. I personally don't know it, but that doesn't mean it doesn't exist - the same goes for everyone else that doesn't know it. In this case, I'd say, "it doesn't exist". As I said, if you really need a name for it, define it yourself. If you were just interested to find out the name, then I'm sorry, I can't help you further.
  – vrugtehagel
  1 hour ago
  

  
  
  
  

 | 
show 2 more comments

• 
  
  
  

  
  

  
  
  
  
  
  

  
  Well as you state, a "simple graph" is not a multigraph... you should probably state what kind of graph you're looking for, because there's plenty graphs "not a multigraph". In fact, as far as I know, "simple graph" does capture all graphs that are not a multigraph. There's nothing about direction in either of their definitions.
  – vrugtehagel
  2 hours ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel I'm simply looking for a generic name for a graph that has no other constraint than "no identical edges". It could be either directed or undirected, have loops or not, doesn't matter. All the other "not a multigraph" names I found have more constraints than just this one.
  – xlecoustillier
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  Then I think "simple graph" is indeed exactly what you're looking for. Unless you want loops. Then you could probably say "simple graph with loops" (as I don't think there's a name for that). Also, simple graphs are undirected, yes, but so are multigraphs. If you want it to be directed, then just say "directed simple graph". The world of graphs is already too full of definitions, let's not add another term to the book ;) of course, if you're writing an article or paper, define it yourself, and that should be perfectly fine.
  – vrugtehagel
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  @vrugtehagel Hence my question. If the answer is "there's no name for that", then fine, and that would explain why I didn't find any :) As an aside, Wikipedia disagrees with you regarding the "undirectedness" of multigraphs (ok then it's called a multidigraph, which underlines what you said about graph theory definition bloating...).
  – xlecoustillier
  1 hour ago
  
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  The problem with this kind of question if the answer doesn't exist, is, nobody can definitively say it doesn't exist. I personally don't know it, but that doesn't mean it doesn't exist - the same goes for everyone else that doesn't know it. In this case, I'd say, "it doesn't exist". As I said, if you really need a name for it, define it yourself. If you were just interested to find out the name, then I'm sorry, I can't help you further.
  – vrugtehagel
  1 hour ago
  

  
  
  
  

Well as you state, a "simple graph" is not a multigraph... you should probably state what kind of graph you're looking for, because there's plenty graphs "not a multigraph". In fact, as far as I know, "simple graph" does capture all graphs that are not a multigraph. There's nothing about direction in either of their definitions.
– vrugtehagel
2 hours ago

Well as you state, a "simple graph" is not a multigraph... you should probably state what kind of graph you're looking for, because there's plenty graphs "not a multigraph". In fact, as far as I know, "simple graph" does capture all graphs that are not a multigraph. There's nothing about direction in either of their definitions.
– vrugtehagel
2 hours ago

@vrugtehagel I'm simply looking for a generic name for a graph that has no other constraint than "no identical edges". It could be either directed or undirected, have loops or not, doesn't matter. All the other "not a multigraph" names I found have more constraints than just this one.
– xlecoustillier
1 hour ago

@vrugtehagel I'm simply looking for a generic name for a graph that has no other constraint than "no identical edges". It could be either directed or undirected, have loops or not, doesn't matter. All the other "not a multigraph" names I found have more constraints than just this one.
– xlecoustillier
1 hour ago

1

1

Then I think "simple graph" is indeed exactly what you're looking for. Unless you want loops. Then you could probably say "simple graph with loops" (as I don't think there's a name for that). Also, simple graphs are undirected, yes, but so are multigraphs. If you want it to be directed, then just say "directed simple graph". The world of graphs is already too full of definitions, let's not add another term to the book ;) of course, if you're writing an article or paper, define it yourself, and that should be perfectly fine.
– vrugtehagel
1 hour ago

Then I think "simple graph" is indeed exactly what you're looking for. Unless you want loops. Then you could probably say "simple graph with loops" (as I don't think there's a name for that). Also, simple graphs are undirected, yes, but so are multigraphs. If you want it to be directed, then just say "directed simple graph". The world of graphs is already too full of definitions, let's not add another term to the book ;) of course, if you're writing an article or paper, define it yourself, and that should be perfectly fine.
– vrugtehagel
1 hour ago

@vrugtehagel Hence my question. If the answer is "there's no name for that", then fine, and that would explain why I didn't find any :) As an aside, Wikipedia disagrees with you regarding the "undirectedness" of multigraphs (ok then it's called a multidigraph, which underlines what you said about graph theory definition bloating...).
– xlecoustillier
1 hour ago

@vrugtehagel Hence my question. If the answer is "there's no name for that", then fine, and that would explain why I didn't find any :) As an aside, Wikipedia disagrees with you regarding the "undirectedness" of multigraphs (ok then it's called a multidigraph, which underlines what you said about graph theory definition bloating...).
– xlecoustillier
1 hour ago

The problem with this kind of question if the answer doesn't exist, is, nobody can definitively say it doesn't exist. I personally don't know it, but that doesn't mean it doesn't exist - the same goes for everyone else that doesn't know it. In this case, I'd say, "it doesn't exist". As I said, if you really need a name for it, define it yourself. If you were just interested to find out the name, then I'm sorry, I can't help you further.
– vrugtehagel
1 hour ago

The problem with this kind of question if the answer doesn't exist, is, nobody can definitively say it doesn't exist. I personally don't know it, but that doesn't mean it doesn't exist - the same goes for everyone else that doesn't know it. In this case, I'd say, "it doesn't exist". As I said, if you really need a name for it, define it yourself. If you were just interested to find out the name, then I'm sorry, I can't help you further.
– vrugtehagel
1 hour ago

 | 
show 2 more comments

active

oldest

votes

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});

xlecoustillier is a new contributor. Be nice, and check out our Code of Conduct.

 

draft saved

draft discarded

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

Name

Email

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004676%2fhow-should-i-call-a-graph-that-is-not-a-multigraph%23new-answer', 'question_page');
}
);

Post as a guest

Name

Email

Required, but never shown

active

oldest

votes

active

oldest

votes

active

oldest

votes

active

oldest

votes

xlecoustillier is a new contributor. Be nice, and check out our Code of Conduct.

 

draft saved

draft discarded

xlecoustillier is a new contributor. Be nice, and check out our Code of Conduct.

xlecoustillier is a new contributor. Be nice, and check out our Code of Conduct.

xlecoustillier is a new contributor. Be nice, and check out our Code of Conduct.

 

draft saved

draft discarded

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

Name

Email

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004676%2fhow-should-i-call-a-graph-that-is-not-a-multigraph%23new-answer', 'question_page');
}
);

Post as a guest

Name

Email

Required, but never shown

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

Name

Email

Required, but never shown

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

Name

Email

Required, but never shown

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

Post as a guest

Name

Email

Required, but never shown

Name

Name

Email

Required, but never shown

Email

Required, but never shown

Email

Required, but never shown

Email

Required, but never shown

Name

Name

Email

Required, but never shown

Email

Required, but never shown

Email

Required, but never shown

Email

Required, but never shown

This page is only for reference, If you need detailed information, please check here