Log in

Relevant bibliographies by topics / Regular graphs / Journal articles

To see the other types of publications on this topic, follow the link: Regular graphs.

Journal articles on the topic 'Regular graphs'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 April 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Regular graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Šoltés, Ľubomír. "Regular graphs with regular neighborhoods." Glasgow Mathematical Journal 34, no. 2 (May 1992): 215–18. http://dx.doi.org/10.1017/s0017089500008740.

Full text

Abstract:

The existence of r-regular graphs such that each edge lies in exactly t triangles, for given integers t < r, is studied. If t is sufficiently close to r then each such connected graph has to be the complete multipartite graph. Relations to graphs with isomorphic neighborhoods are also considered.

APA, Harvard, Vancouver, ISO, and other styles

2

Zelinka, Bohdan. "Locally regular graphs." Mathematica Bohemica 125, no. 4 (2000): 481–84. http://dx.doi.org/10.21136/mb.2000.126271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Markhabatov, Nurlan, and Sergey Sudoplatov. "APPROXIMATIONS OF REGULAR GRAPHS." Herald of Kazakh-British technical university 19, no. 1 (March 31, 2022): 44–49. http://dx.doi.org/10.55452/1998-6688-2022-19-1-44-49.

Full text

Abstract:

The paper [11] raised the question of describing the cardinality and types of approximations for natural families of theories. In the present paper, a partial answer to this question is given, and the study of approximation and topological properties of natural classes of theories is also continued. We consider a cycle graph consisting of one cycle or, in other words, a certain number of vertices (at least 3 if the graph is simple) connected into a closed chain. It is shown that an infinite cycle graph is approximated by finite cycle graphs. Approximations of regular graphs by finite regular graphs are considered. On the other hand, approximations of acyclic regular graphs by finite regular graphs are considered. It is proved that any infinite regular graph is pseudofinite. And also, for any k, any k-regular graph is homogeneous and pseudofinite.Examples of pseudofinite 3-regular and 4-regular graphs are given.

APA, Harvard, Vancouver, ISO, and other styles

4

Ivančo, Jaroslav. "On supermagic regular graphs." Mathematica Bohemica 125, no. 1 (2000): 99–114. http://dx.doi.org/10.21136/mb.2000.126259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guest, Kelly B., James M. Hammer, Peter D. Johnson, and Kenneth J. Roblee. "Regular clique assemblies, configurations, and friendship in Edge-Regular graphs." Tamkang Journal of Mathematics 48, no. 4 (December 30, 2017): 301–20. http://dx.doi.org/10.5556/j.tkjm.48.2017.2237.

Full text

Abstract:

An edge-regular graph is a regular graph in which, for some $\lambda$, any two adjacent vertices have exactly $\lambda$ common neighbors. This paper is about the existence and structure of edge-regular graphs with $\lambda =1$ and about edge-regular graphs with $\lambda >1$ which have local neighborhood structure analogous to that of the edge-regular graphs with $\lambda =1$.

APA, Harvard, Vancouver, ISO, and other styles

6

Athul, T. B., and G. Suresh Singh. "TOTAL GRAPH OF REGULAR GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 6 (July 20, 2020): 4213–20. http://dx.doi.org/10.37418/amsj.9.6.103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Changping. "Voting 'Against' in regular and nearly regular graphs." Applicable Analysis and Discrete Mathematics 4, no. 1 (2010): 207–18. http://dx.doi.org/10.2298/aadm100213014w.

Full text

Abstract:

Let G = (V,E) be a graph. A function f : V (G)-> {-1,1} is called negative if ?vEN[v] f(v)?1 for every v E V(G): A negative function f of a graph G is maximal if there exists no negative function g such that g ? f and g(v) ? f(v) for every v E V: The minimum of the values of ?vEV f(v); taken over all maximal negative functions f, is called the lower against number and is denoted by ?*N (G): In this paper, we present lower bounds on this number for regular graphs and nearly regular graphs, and we characterize the graphs attaining those bounds.

APA, Harvard, Vancouver, ISO, and other styles

8

Seethalakshmi, R., and R. B. Gnanajothi. "Strong Regular L-Fuzzy Graphs." International Journal of Trend in Scientific Research and Development Volume-1, Issue-5 (August 31, 2017): 503–9. http://dx.doi.org/10.31142/ijtsrd2333.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gyürki, Štefan. "Small Directed Strongly Regular Graphs." Algebra Colloquium 27, no. 01 (February 25, 2020): 11–30. http://dx.doi.org/10.1142/s1005386720000036.

Full text

Abstract:

The goal of the present paper is to provide a gallery of small directed strongly regular graphs. For each graph of order n ≤ 12 and valency k < n/2, a diagram is depicted, its relation to other small directed strongly regular graphs is revealed, the full group of automorphisms is described, and some other nice properties are given. To each graph a list of interesting subgraphs is provided as well.

APA, Harvard, Vancouver, ISO, and other styles

10

Et. al., PuruchothamaNayakiM. "Distance Based Topological Indices And Regular Graphs." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 11, 2021): 5191–96. http://dx.doi.org/10.17762/turcomat.v12i3.2147.

Full text

Abstract:

In this article, we are using the regular graph of even number of vertices and computing the distance balanced graphs. First we take a graph for satisfying regular definition and then we compute the Mostar index of that particular graph. If the Mostar index of that particular graph is zero, then the graph is said to be a distance balanced graph. So we discuss first distance balanced graph. Suppose if we delete one edge in that particular graph, that is non-regular graph, we can verify the balanced graph is whether distance balanced graph or not. We discuss and compute the Mostar index of certain regular and non-regular graphs are balanced distance or not. Finally we see few theorems are related in this topic. So in this paper, we study some distance based topological indices for regular graphs and also cubic graphs.

APA, Harvard, Vancouver, ISO, and other styles

11

Li, Jing Jian, Bo Ling, and Jicheng Ma. "On tetravalent s-regular Cayley graphs." Journal of Algebra and Its Applications 16, no. 10 (September 20, 2017): 1750195. http://dx.doi.org/10.1142/s021949881750195x.

Full text

Abstract:

A Cayley graph [Formula: see text] is said to be core-free if [Formula: see text] is core-free in some [Formula: see text] for [Formula: see text]. A graph [Formula: see text] is called [Formula: see text]-regular if [Formula: see text] acts regularly on its [Formula: see text]-arcs. It is shown in this paper that if [Formula: see text], then there exist no core-free tetravalent [Formula: see text]-regular Cayley graphs; and for [Formula: see text], every tetravalent [Formula: see text]-regular Cayley graph is a normal cover of one of the three known core-free graphs. In particular, a characterization of tetravalent [Formula: see text]-regular Cayley graphs is given.

APA, Harvard, Vancouver, ISO, and other styles

12

Prasetyo, Joko. "FAKTORISASI PADA GRAF REGULER." EDUPEDIA 4, no. 1 (April 18, 2020): 75. http://dx.doi.org/10.24269/ed.v4i1.434.

Full text

Abstract:

This research aims to: (1) know the criteria of a graph that has a -factor, (2) know the conditions of a regular graph that has a 1-factorization , (3) know the conditions of a regular graph that has a 2-factorization.This research is a qualitative descriptive study using the method of literature study or literature review where a study of books, scientific journals, and other literature languages is carried out relating to factorization on regular graphs. This research begins by discussing the definitions and examples of euler graphs and regular bipartite multigraphs. Next in reviewing the terms of a regular graph which has a 1-factorization and which has a 2-factorization, it starts by discussing the definition and theorem of matching on bipartite graphs, definitions and examples of factorization graphs, then discussing the proof of theorem of regular graphs that have a 1-factor and a regular graph which has a 2-factor.The results of this study indicate that: (1) Graph is said to be -factorable or can be factored into -factor , if can be decomposed or be eksplained into spanning subgraphs , where each has a -factor and is edge-disjoint from , that is 1) 2) … n) = . (2) The condition for a graph that has a 1-factorization is, if the graph is a -regular bipartite multigraph, with . (3) The condition for a graph that has a 2-factorization is, if the graph is a -regular graph, with . Key words: Bipartite graphs, Factorization, Decomposition, Regular graph.

APA, Harvard, Vancouver, ISO, and other styles

13

Bernshteyn, Anton, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songlin Shan, and Andrew Uzzell. "Regular colorings in regular graphs." Discussiones Mathematicae Graph Theory 40, no. 3 (2020): 795. http://dx.doi.org/10.7151/dmgt.2149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Gutiérrez, A., and A. S. Lladó. "Regular packings of regular graphs." Discrete Mathematics 244, no. 1-3 (February 2002): 83–94. http://dx.doi.org/10.1016/s0012-365x(01)00065-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Bollobás, B., Akira Saito, and N. C. Wormald. "Regular factors of regular graphs." Journal of Graph Theory 9, no. 1 (1985): 97–103. http://dx.doi.org/10.1002/jgt.3190090107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Katerinis, P. "Regular factors in regular graphs." Discrete Mathematics 113, no. 1-3 (April 1993): 269–74. http://dx.doi.org/10.1016/0012-365x(93)90523-v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Fiol, M. A., E. Garriga, and J. L. A. Yebra. "From regular boundary graphs to antipodal distance-regular graphs." Journal of Graph Theory 27, no. 3 (March 1998): 123–40. http://dx.doi.org/10.1002/(sici)1097-0118(199803)27:3<123::aid-jgt2>3.0.co;2-q.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Haythorpe, M., and A. Newcombe. "Constructing families of cospectral regular graphs." Combinatorics, Probability and Computing 29, no. 5 (June 30, 2020): 664–71. http://dx.doi.org/10.1017/s096354832000019x.

Full text

Abstract:

AbstractA set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid for special cases of a property introduced by Schwenk. For the case of cubic (3-regular) graphs, computational results are given which show that the construction generates a large proportion of the cubic graphs, which are cospectral with another cubic graph.

APA, Harvard, Vancouver, ISO, and other styles

19

FIOL, M. A. "Some Spectral Characterizations of Strongly Distance-Regular Graphs." Combinatorics, Probability and Computing 10, no. 2 (March 2001): 127–35. http://dx.doi.org/10.1017/s0963548301004564.

Full text

Abstract:

A graph Γ with diameter d is strongly distance-regular if Γ is distance-regular and its distance-d graph Γd is strongly regular. Some known examples of such graphs are the connected strongly regular graphs, with distance-d graph Γd = Γ (the complement of Γ), and the antipodal distance-regular graphs. Here we study some spectral conditions for a (regular or distance-regular) graph to be strongly distance-regular. In particular, for the case d = 3 the following characterization is proved. A regular (connected) graph Γ, with distinct eigenvalues λ0 > λ1 > λ2 > λ3, is strongly distance-regular if and only if λ2 = −1, and Γ3 is k-regular with degree k satisfying an expression which depends only on the order and the different eigenvalues of Γ.

APA, Harvard, Vancouver, ISO, and other styles

20

Vasanthi, R., and K. Subramanian. "On Vertex Covering Transversal Domination Number of Regular Graphs." Scientific World Journal 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/1029024.

Full text

Abstract:

A simple graphG=(V,E)is said to ber-regular if each vertex ofGis of degreer. The vertex covering transversal domination numberγvct(G)is the minimum cardinality among all vertex covering transversal dominating sets ofG. In this paper, we analyse this parameter on different kinds of regular graphs especially forQnandH3,n. Also we provide an upper bound forγvctof a connected cubic graph of ordern≥8. Then we try to provide a more stronger relationship betweenγandγvct.

APA, Harvard, Vancouver, ISO, and other styles

21

Potočnik, Primož, and Janoš Vidali. "Girth-regular graphs." Ars Mathematica Contemporanea 17, no. 2 (November 4, 2019): 349–68. http://dx.doi.org/10.26493/1855-3974.1684.b0d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bertrand, Nathalie, and Christophe Morvan. "Probabilistic regular graphs." Electronic Proceedings in Theoretical Computer Science 39 (October 28, 2010): 77–90. http://dx.doi.org/10.4204/eptcs.39.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Anderson, I., A. E. Brouwer, A. M. Cohen, and A. Neumaier. "Distance Regular Graphs." Mathematical Gazette 74, no. 469 (October 1990): 321. http://dx.doi.org/10.2307/3619866.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

ALAVI, YOUSEF, GARY CHARTRAND, DON R. LICK, and HENDA C. SWART. "Highly Regular Graphs." Annals of the New York Academy of Sciences 576, no. 1 Graph Theory (December 1989): 20–29. http://dx.doi.org/10.1111/j.1749-6632.1989.tb16379.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Sascha Kurz and Rom Pinchasi. "Regular Matchstick Graphs." American Mathematical Monthly 118, no. 3 (2011): 264. http://dx.doi.org/10.4169/amer.math.monthly.118.03.264.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Joseph, Shiny, and V. Ajitha. "Stress regular graphs." Malaya Journal of Matematik 8, no. 3 (2020): 1152–54. http://dx.doi.org/10.26637/mjm0803/0072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kratochvı́l, Jan, Andrzej Proskurowski, and Jan Arne Telle. "Covering Regular Graphs." Journal of Combinatorial Theory, Series B 71, no. 1 (September 1997): 1–16. http://dx.doi.org/10.1006/jctb.1996.1743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Akbari, Saieed, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh, and Ali Iranmanesh. "Equimatchable Regular Graphs." Journal of Graph Theory 87, no. 1 (March 8, 2017): 35–45. http://dx.doi.org/10.1002/jgt.22138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Severini, Simone, and Gregor Tanner. "Regular quantum graphs." Journal of Physics A: Mathematical and General 37, no. 26 (June 17, 2004): 6675–86. http://dx.doi.org/10.1088/0305-4470/37/26/005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Thomassen, Carsten. "Factorizing regular graphs." Journal of Combinatorial Theory, Series B 141 (March 2020): 343–51. http://dx.doi.org/10.1016/j.jctb.2019.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Mollard, Michel. "Cycle-regular graphs." Discrete Mathematics 89, no. 1 (May 1991): 29–41. http://dx.doi.org/10.1016/0012-365x(91)90397-k.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Ganesan, Ghurumuruhan. "Graph extensions, edit number and regular graphs." Discrete Applied Mathematics 258 (April 2019): 269–75. http://dx.doi.org/10.1016/j.dam.2018.10.042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Cioabă, Sebastian M., Randall J. Elzinga, Michelle Markiewitz, Kevin Vander Meulen, and Trevor Vanderwoerd. "Addressing graph products and distance-regular graphs." Discrete Applied Mathematics 229 (October 2017): 46–54. http://dx.doi.org/10.1016/j.dam.2017.05.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Al-Masarwah, Anas, and Majdoleen Abu Qamar. "Certain Types of Fuzzy Soft Graphs." New Mathematics and Natural Computation 14, no. 02 (June 3, 2018): 145–56. http://dx.doi.org/10.1142/s1793005718500102.

Full text

Abstract:

In this paper, we introduce the concepts of uniform vertex fuzzy soft graphs, uniform edge fuzzy soft graphs, degree of a vertex, total degree of a vertex and complement fuzzy soft graphs with some examples. Also, we study regular and totally regular fuzzy soft graphs, and the conditions under which the complement of regular fuzzy soft graph becomes regular as well as totally regular are discussed. Also, we obtain some results related to regular, totally regular and complete fuzzy soft graphs.

APA, Harvard, Vancouver, ISO, and other styles

35

Kibangou, Alain Y., and Christian Commault. "Observability in Connected Strongly Regular Graphs and Distance Regular Graphs." IEEE Transactions on Control of Network Systems 1, no. 4 (December 2014): 360–69. http://dx.doi.org/10.1109/tcns.2014.2357532.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wulur, Arthur, Benny Pinontoan, and Mans Mananohas. "Rectilinear Monotone r-Regular Planar Graphs for r = {3, 4, 5}." d'CARTESIAN 4, no. 1 (February 10, 2015): 103. http://dx.doi.org/10.35799/dc.4.1.2015.8318.

Full text

Abstract:

A graph G consists of non-empty set of vertex/vertices (also called node/nodes) and the set of lines connecting two vertices called edge/edges. The vertex set of a graph G is denoted by V(G) and the edge set is denoted by E(G). A Rectilinear Monotone r-Regular Planar Graph is a simple connected graph that consists of vertices with same degree and horizontal or diagonal straight edges without vertical edges and edges crossing. This research shows that there are infinite family of rectilinear monotone r-regular planar graphs for r = 3and r = 4. For r = 5, there are two drawings of rectilinear monotone r-regular planar graphs with 12 vertices and 16 vertices. Keywords: Monotone Drawings, Planar Graphs, Rectilinear Graphs, Regular Graphs

APA, Harvard, Vancouver, ISO, and other styles

37

Paulraja, P., and T. Sivakaran. "Decompositions of some regular graphs into unicyclic graphs of order five." Discrete Mathematics, Algorithms and Applications 11, no. 04 (August 2019): 1950042. http://dx.doi.org/10.1142/s1793830919500423.

Full text

Abstract:

For a graph [Formula: see text] and a subgraph [Formula: see text] of [Formula: see text] an [Formula: see text]-decomposition of [Formula: see text] is a partition of the edge set of [Formula: see text] into subsets [Formula: see text] [Formula: see text] such that each [Formula: see text] induces a graph isomorphic to [Formula: see text] It is proved that the necessary conditions are sufficient for the existence of an [Formula: see text]-decomposition of the graph [Formula: see text] where [Formula: see text] is any simple connected unicyclic graph of order five, × denotes the tensor product of graphs and [Formula: see text] denotes the multiplicity of the edges. In fact, using the above characterization, a necessary and sufficient condition for the graph [Formula: see text] [Formula: see text] and [Formula: see text] to admit an [Formula: see text]-decomposition is obtained. Similar results for the complete graphs and complete multipartite graphs are proved in: [J.-C. Bermond et al. [Formula: see text]-decomposition of [Formula: see text], where [Formula: see text] has four vertices or less, Discrete Math. 19 (1977) 113–120, J.-C. Bermond et al. Decomposition of complete graphs into isomorphic subgraphs with five verices, Ars Combin. 10 (1980) 211–254, M. H. Huang, Decomposing complete equipartite graphs into connected unicyclic graphs of size five, Util. Math. 97 (2015) 109–117].

APA, Harvard, Vancouver, ISO, and other styles

38

Sawollek, Jörg. "Embeddings of 4-Regular Graphs into 3-Space." Journal of Knot Theory and Its Ramifications 06, no. 05 (October 1997): 727–49. http://dx.doi.org/10.1142/s0218216597000406.

Full text

Abstract:

Embeddings of 4-regular graphs into 3-space are examined by studying graph diagrams, i.e. projections of embedded graphs to an appropriate plane. New diagrams can be constructed from the old ones by replacing graph vertices with rational tangles, and these diagrams lead to topological invariants of embedded graphs. The new invariants are calculated for some examples, in particular for classes of alternating diagrams of the figure-eight graph. As an application, it is shown that these diagrams have minimal crossing number, which gives generalizations to some of the so-called Tait conjectures.

APA, Harvard, Vancouver, ISO, and other styles

39

Ma, Xiaobin, Dein Wong, and Jinming Zhou. "Unicyclic graphs with regular endomorphism monoids." Discrete Mathematics, Algorithms and Applications 08, no. 02 (May 26, 2016): 1650020. http://dx.doi.org/10.1142/s1793830916500208.

Full text

Abstract:

The motivation of this paper comes from an open question: which graphs have regular endomorphism monoids? In this paper, we give a definitely answer for unicyclic graphs, proving that a unicyclic graph [Formula: see text] is End-regular if and only if, either [Formula: see text] is an even cycle with 4, 6 or 8 vertices, or [Formula: see text] contains an odd cycle [Formula: see text] such that the distance of any vertex to [Formula: see text] is at most 1, i.e., [Formula: see text]. The join of two unicyclic graphs with a regular endomorphism monoid is explicitly described.

APA, Harvard, Vancouver, ISO, and other styles

40

Hemmeter, Joe. "Distance-Regular Graphs and Halved Graphs." European Journal of Combinatorics 7, no. 2 (April 1986): 119–29. http://dx.doi.org/10.1016/s0195-6698(86)80037-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Haemers, W. H., and E. Spence. "Graphs cospectral with distance-regular graphs." Linear and Multilinear Algebra 39, no. 1-2 (July 1995): 91–107. http://dx.doi.org/10.1080/03081089508818382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

HANAKI, RYO. "REGULAR PROJECTIONS OF KNOTTED DOUBLE-HANDCUFF GRAPHS." Journal of Knot Theory and Its Ramifications 18, no. 11 (November 2009): 1475–92. http://dx.doi.org/10.1142/s0218216509007567.

Full text

Abstract:

A finite set of specific knotted double-handcuff graphs is shown to be minimal among those which produce all projections of knotted double-handcuff graphs. In addition, we show that a double-handcuff graph has no strongly almost trivial spatial embeddings.

APA, Harvard, Vancouver, ISO, and other styles

43

Hoffmann, Arne. "Regular factors in regular multipartite graphs." Electronic Notes in Discrete Mathematics 5 (July 2000): 181–84. http://dx.doi.org/10.1016/s1571-0653(05)80157-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Hoffmann, Arne. "Regular factors in regular multipartite graphs." Discrete Mathematics 258, no. 1-3 (December 2002): 43–62. http://dx.doi.org/10.1016/s0012-365x(02)00261-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Lu, Hongliang. "Regular Graphs, Eigenvalues and Regular Factors." Journal of Graph Theory 69, no. 4 (December 19, 2011): 349–55. http://dx.doi.org/10.1002/jgt.20581.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Greaves, Gary R. W., and Jack H. Koolen. "Edge-regular graphs with regular cliques." European Journal of Combinatorics 71 (June 2018): 194–201. http://dx.doi.org/10.1016/j.ejc.2018.04.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Pech, Christian. "On highly regular strongly regular graphs." Algebraic Combinatorics 4, no. 5 (November 3, 2021): 843–78. http://dx.doi.org/10.5802/alco.183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Deng, Bo, Caibing Chang, Haixing Zhao, and Kinkar Chandra Das. "Construction for the Sequences of Q-Borderenergetic Graphs." Mathematical Problems in Engineering 2020 (July 18, 2020): 1–5. http://dx.doi.org/10.1155/2020/6176849.

Full text

Abstract:

This research intends to construct a signless Laplacian spectrum of the complement of any k-regular graph G with order n. Through application of the join of two arbitrary graphs, a new class of Q-borderenergetic graphs is determined with proof. As indicated in the research, with a regular Q-borderenergetic graph, sequences of regular Q-borderenergetic graphs can be constructed. The procedures for such a construction are determined and demonstrated. Significantly, all the possible regular Q-borderenergetic graphs of order 7<n≤10 are determined.

APA, Harvard, Vancouver, ISO, and other styles

49

Siehler, Jacob A. "Xor-Magic Graphs." Recreational Mathematics Magazine 6, no. 11 (September 1, 2019): 35–44. http://dx.doi.org/10.2478/rmm-2019-0004.

Full text

Abstract:

Abstract A connected graph on 2n vertices is defined to be xor-magic if the vertices can be labeled with distinct n-bit binary numbers in such a way that the label at each vertex is equal to the bitwise xor of the labels on the adjacent vertices. We show that there is at least one 3-regular xor-magic graph on 2n vertices for every n ⩾ 2. We classify the 3-regular xor-magic graphs on 8 and 16 vertices, and give multiple examples of 3-regular xor-magic graphs on 32 vertices, including the well-known Dyck graph.

APA, Harvard, Vancouver, ISO, and other styles

50

Huang, Liangsong, Yu Hu, Yuxia Li, P. K. Kishore Kumar, Dipak Koley, and Arindam Dey. "A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications." Mathematics 7, no. 6 (June 17, 2019): 551. http://dx.doi.org/10.3390/math7060551.

Full text

Abstract:

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. The concepts of the regularity and degree of a node play a significant role in both the theory and application of graph theory in the neutrosophic environment. In this work, we describe the utility of the regular neutrosophic graph and bipartite neutrosophic graph to model an assignment problem, a road transport network, and a social network. For this purpose, we introduce the definitions of the regular neutrosophic graph, star neutrosophic graph, regular complete neutrosophic graph, complete bipartite neutrosophic graph, and regular strong neutrosophic graph. We define the d m - and t d m -degrees of a node in a regular neutrosophic graph. Depending on the degree of the node, this paper classifies the regularity of a neutrosophic graph into three types, namely d m -regular, t d m -regular, and m-highly irregular neutrosophic graphs. We present some theorems and properties of those regular neutrosophic graphs. The concept of an m-highly irregular neutrosophic graph on cycle and path graphs is also investigated in this paper. The definition of busy and free nodes in a regular neutrosophic graph is presented here. We introduce the idea of the μ -complement and h-morphism of a regular neutrosophic graph. Some properties of complement and isomorphic regular neutrosophic graphs are presented here.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!