[Abstract] This paper considers figures with vertices and edges as components, and discusses how many figures there are, with the aim of classifying them. These figures are called graphs. Graphs have been classified for many years on the basis of their various attributes. In this context, we encounter the problem of counting the number of graphs with the given properties. In graph theory, this problem has been called the enumeration problem. This paper considers an enumeration of labeled graphs. Riddell (1951) derived a simple, beautiful equation on an enumeration of labeled graphs. This paper shows a broad applicationof this equation
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
AbstractA simple decomposition for graphs yields generating functions for counting graphs by edges a...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
publisher著者専攻: 離散数学[Abstract] This paper considers figures with vertices and edges as components, an...
[Abstract] This paper considers figures with vertices and edges as components, and discusses how man...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recu...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recu...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
AbstractConstructive combinatorial proofs are given for recurrence formulas which count, respectivel...
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain ...
This thesis presents and proves Pólya's enumeration theorem (PET) along with the necessary backgroun...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
AbstractA simple decomposition for graphs yields generating functions for counting graphs by edges a...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
publisher著者専攻: 離散数学[Abstract] This paper considers figures with vertices and edges as components, an...
[Abstract] This paper considers figures with vertices and edges as components, and discusses how man...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recu...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recu...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
AbstractConstructive combinatorial proofs are given for recurrence formulas which count, respectivel...
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain ...
This thesis presents and proves Pólya's enumeration theorem (PET) along with the necessary backgroun...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...
AbstractA simple decomposition for graphs yields generating functions for counting graphs by edges a...
Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combin...